实验三

#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <math.h>
int digit(int);
void judge(int);
static int x[10];//未赋值时默认为0
int main()
{
    int n;
    int i, j, k;
    int each1,each2;
    int n1, n2;
    for (n = 10; n <= 100; n++)//若n的平方和n的立方中0~9的全有且不重复，则n^2和n^3的位数和必须为10，由此可判断其大致的存在区间
    {
        n1 = pow(n, 2);
        
        n2 = pow(n, 3);
        for (i = 1; i <= digit(n1); i)
        {            
            each1 = n1 % 10;            
            judge(each1);
            n1 = n1 / 10;
        }        
        for (j = 1; j <= digit(n2); j)
        {
            each2 = n2 % 10;            
            judge(each2);
            n2 = n2 / 10;
        }
                
        if (x[0] == 1 && x[1] == 1 && x[2] == 1 && x[3] == 1 && x[4] == 1 && x[5] == 1 && x[6] == 1 && x[7] == 1 && x[8] == 1 && x[9] == 1)
        {
            printf("%d\n", n);
        }
        for (k = 0; k <= 9; k++)
        {
            x[k] = 0;
        }
    }
    return 0;
}

int digit(int s) {
    double n;
    n = floor(log10(s) + 1);
    return n;
}
void judge(int n) {
    if (n == 0)
        x[0]++;
    else if (n == 1)
        x[1]++;
    else if (n == 2)
        x[2]++;
    else if (n == 3)
        x[3]++;
    else if (n == 4)
        x[4]++;
    else if (n == 5)
        x[5]++;
    else if (n == 6)
        x[6]++;
    else if (n == 7)
        x[7]++;
    else if (n == 8)
        x[8]++;
    else if (n == 9)
        x[9]++;
}

 

 

#include<stdio.h>
int i = 0;
void hanoi(unsigned int n, char from, char temp, char to);
void moveplate(unsigned int n, char from, char to);
int main()
{
    unsigned int n;
    while (scanf("%u", &n) != EOF)
    {
        i = 0;
        hanoi(n, 'A', 'B', 'C');
        printf("共移动了%d次\n", i);
        
    }
    return 0;
}
void hanoi(unsigned int n, char from, char temp, char to)
{
    
    if (n == 1)
        moveplate(n, from, to);
    else
    {
        hanoi(n - 1, from, to, temp);
        moveplate(n, from, to);
        hanoi(n - 1, temp, from, to);
    }
    
}
void moveplate(unsigned int n, char from, char to)
{
    i++;
    printf("%u:%c-->%c\n", n, from, to);
}

#include <stdio.h>
#include <math.h>
long func(long s);   // 函数声明

int main() {

    long s, t;

    printf("Enter a number: ");
    while (scanf("%ld", &s) != EOF) {
        t = func(s); // 函数调用
        printf("new number is: %ld\n\n", t);
        printf("Enter a number: ");
    }

    return 0;
}

long func(long s) {
    long x[20];
    int i,j;
    int k = 0;
    double n;//n为输入的数的位数
    int t;
    long ans = 0;
    n = floor(log10(s) + 1);
    for (i = n; i > 0; i--)
    {
        
        t = (s % 10) % 2;//判断s的最低位是否为奇数
        
        if (t == 1)//如果是奇数
        {
            x[k] = s % 10;//
            
            
            k++;
        }
        s = s/10;
       
    }
    for (j = 0; j < k; j++)
    {
        ans += pow(10, j) * x[j];
        
    }
    return ans;
   }

 

#define CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <windows.h>
#define N 80
void print_text(int line, int col, char text[]); // 函数声明
void print_spaces(int n); // 函数声明
void print_blank_lines(int n); // 函数声明
int main() {
    int line, col, i;
    char text[N] = "hi, November~";
    srand(time(0)); // 以当前系统时间作为随机种子
    for (i = 1; i <= 10; ++i) {
        line = rand() % 25;
        col = rand() % 80;
        print_text(line, col, text);
        Sleep(1000); // 暂停1000ms
    }
    return 0;
}
// 打印n个空格
void print_spaces(int n) {
    int i;
    for (i = 1; i <= n; ++i)
        printf(" ");
}
// 打印n行空白行
void print_blank_lines(int n) {
    int i;
    for (i = 1; i <= n; ++i)
        printf("\n");
}
// 在第line行第col列打印一段文本
void print_text(int line, int col, char text[]) {
    print_blank_lines(line - 1); // 打印(line-1)行空行
    print_spaces(col - 1); // 打印(col-1)列空格
    printf("%s", text); // 在第line行、col列输出text中字符串
}

N为80，说明当重复80次后程序会终止，在这80次中会随即输出空格，换行，和

hi, November~这三个之一

// 利用局部static变量的特性，计算阶乘

#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
int func(int n, int m);

int main() {
    int n, m;

    while (scanf("%d%d", &n, &m) != EOF)
        printf("n = %d, m = %d, ans = %d\n", n, m, func(n, m));

    return 0;
}

int func(int n,int m) {
    int i,j,k;
    int up = 1;
    int down1 = 1;
    int down2 = 1;
    int ans;
    for (i = n; i > 0; i--)
    {
        up *= i;
    }
    for (j = m; j > 0; j--)
    {
        down1 *= j;
    }
    for (k = n - m; k > 0; k--)
    {
        down2 *= k;
    }
    ans = up / (down1 * down2);
    return ans;

}
// 待补足。。。

#include <stdio.h>
int func(int n, int m);
int ans = 3;
int main() {
    int n, m;

    while (scanf("%d%d", &n, &m) != EOF)
        printf("n = %d, m = %d, ans = %d\n", n, m, func(n, m));

    return 0;
}

int func(int n, int m) {
   
    int a;
    
     
    if (n == m || m == 0)
        return 1;
    else if (n < m)
        return 0;
    else if (m == 1)
        return n;
   
    else if (n > 2)
    {
        ans = func(n - 1, m) + func(n - 1, m - 1);
        
        return ans;
    }



    



}
// 待补足。。。

 

// 练习：局部static变量特性

#include <stdio.h>
int func(int, int);        // 函数声明

int main() {
    int k = 4, m = 1, p1, p2;

    p1 = func(k, m);    // 函数调用
    p2 = func(k, m);    // 函数调用
    printf("%d, %d\n", p1, p2);

    return 0;
}

// 函数定义
int func(int a, int b) {
    static int m = 0, i = 2;

    i += m + 1;
    m = i + a + b;

    return m;
}

#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
long long func(int n); // 函数声明
long long ans = 2;

int main() {
    int n;
    long long f;

    while (scanf("%d", &n) != EOF) {
        f = func(n); // 函数调用
        printf("n = %d, f = %lld\n", n, f);
    }

    return 0;
}



long long func(int n) {
    
    if (n == 1)
    {
        long long m;
        m = ans;
        ans = 2;
        return m - 1;
     
    }
    else if(n > 1)
    {
        
        n--;
        ans = 2 * ans;
        func(n);
    }


}
// 待补足。。。

 

 

#include <stdio.h>
long long fac(int n); // 函数声明

int main() {
    int i, n;

    printf("Enter n: ");
    scanf("%d", &n);
    for (i = 1; i <= n; ++i)
        printf("%d! = %lld\n", i, fac(i));

    return 0;
}

// 函数定义
long long fac(int n) {
    static long long p = 1;

    p = p * n;

    return p;
}