实验3

Task2_2

// 练习：局部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;
}

 

RS2_2

static变量在主函数结束后才释放内存

 

Task3

#include <stdio.h>
long long func(int n);
int main() {
    int n;
    long long f;
    while (scanf("%d", &n) != EOF) {
        f = func(n)-1;
        printf("n = %d, f = %lld\n", n,f);
    }
    return 0;
}
long long func(int n){
    if(n==0) return 1;
    if(n>=1) return 2*func(n-1);
}

 

 

RS3

 

Task4_1迭代

#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;
    int Rs=1;
    for(i=n-m+1;i<=n;i++){
        Rs=Rs*i;
    }
    for(i=1;i<=m;i++){
        Rs=Rs/i;
    }
    return Rs;
}  

 

RS4_1迭代

 

Task4_2递归

 

#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) {  
    if(m==0||m==n) return 1;
    else return func(n-1,m)+func(n-1,m-1);
    
}

 

RS4_2递归

 

Task5

#include <stdio.h> 
int hano(int ,char from ,char still, char to) ;
int main(){
    int n;
    while(scanf("%d",&n)!=EOF){
        printf("******Total:%d******",hano(n,'A','B','C'));
    }
    return 0;
}
int hano(int n, char from, char to, char still) {  
    static int cnt=0;
    if (n == 1) {  
        printf(" 1  %c --> %c\n", from, to);
        cnt++;
        return cnt;  
    }  
    hano(n - 1, from, still, to);  
    printf(" %d  %c --> %c\n", n, from, to);
    cnt++;  
    hano(n - 1, still, to, from);  
        
}  

 

RS5

 

Task6

#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 UlRs,Rs=0,stl,r; 
    stl=s;
    int i=0;
    while(stl>0){
        r=stl%10;
        if(r%2==1){
            Rs=10*Rs+r;
            i++;
        }
        stl/=10;
    }
    for(;i>0;i--){
        r=Rs%10;
        Rs/=10;
        UlRs=UlRs*10+r;    
    }
    return UlRs;
}

 

RS6

 

Task7

#include <stdio.h>  
#include <stdbool.h>  
  
bool has(int num) {  
    bool digits[10] = { false };  
    while (num > 0) {  
        int digit = num % 10;  
        if (digits[digit]) {  
            return true;  
        }  
        digits[digit] = true;  
        num /= 10;  
    }  
    return false;  
}  
  
bool hasa(int num1, int num2) {  
    bool digits[10] = { false };  
    while (num1 > 0 || num2 > 0) {  
        if (num1 > 0) {  
            int digit = num1 % 10;  
            digits[digit] = true;  
            num1 /= 10;  
        }  
        if (num2 > 0) {  
            int digit = num2 % 10;  
            digits[digit] = true;  
            num2 /= 10;  
        }  
    }  
    for (int i = 0; i < 10; i++) {  
        if (!digits[i]) {  
            return false;  
        }  
    }  
    return true;  
}  
  
int main() {  
    for (int i = 0; i < 10000; i++) {  
        long square = i * i;  
        long cube = i * i * i;  
        if (!has(square) && !has(cube) && hasa(square, cube)) {  
            printf("找到符合条件的数字：%d\n", i);  
            return 0;  
        }  
    }  
    printf("没有找到符合条件的数字\n");  
    return 0;  
}

 

RS7