1

 1 #include<stdio.h>
 2 long long fun(int n);
 3 
 4 int main(){
 5     int n;
 6     long long f;
 7     
 8     while(scanf("%d", &n) != EOF){
 9         f = fun(n);
10         printf("n = %d, f = %lld\n", n, f);
11     }
12     
13     return 0;
14 }
15 
16 long long fun(int n){
17     if(n == 1)
18     return 1;
19     else
20     return 2*(fun(n-1)+1)-1;
21 }

 

 

2

#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;
}

 

 1 #include<stdio.h>
 2 long long fac(int n);
 3   
 4 int main(){
 5     int i, n;
 6     
 7     printf("Enter n:");
 8     scanf("%d", &n);
 9     
10     for(i=1;i<=n;++i)
11         printf("%d! = %lld\n", i, fac(i));
12         
13     return 0;
14 }
15  
16 long long fac(int n){
17     static long long p = 1;
18     printf("p = %lld\n", p);
19     p = p*n;    
20     return p;
21 }

 

3

#include<stdio.h>
#define N 1000

int fun(int n, int m,int bb[N]) {
    int i, j, k=0,flag;
    
    for(j=n;j<=m;j++){
        flag = 1;
        for(i=2;i<j;i++)
        if(j % i == 0){
            flag = 0;
            break;    
        }
        if(flag == 1)
        bb[k++] = j;    
    }
    return k;
}
  
int main(){
    int n=0, m=0, i, k, bb[N];
    
    while(scanf("%d %d",&n, &m) != EOF){
    

    
    for(i=0;i<m-n;i++)
        bb[i] = 0;
        
    k=fun(n,m,bb);
    
    for(i=0;i<k;i++)
        printf("%4d",bb[i]);
        printf("\n");
}
        
    return 0;
}

 

4

 1 #include <stdio.h>
 2 void dec2n(int x, int n);
 3 
 4 int main() {
 5     int x;
 6 
 7     printf("输入一个十进制整数: ");
 8     scanf("%d", &x);
 9 
10     dec2n(x, 2);
11     dec2n(x, 8);
12     dec2n(x,16);
13     return 0;
14 }
15 
16 void dec2n(int x, int n) {
17     int i,a,N;
18     char b[100];
19     
20     for(i=0;x!=0;i++){
21     b[i] = x % n;
22     x =  x / n ;
23     }
24     if(b[i]>9)
25     switch(b[i])
26     {
27         case 10:b[i]='A';break;
28         case 11:b[i]='B';break;
29         case 12:b[i]='C';break;
30         case 13:b[i]='D';break;
31         case 14:b[i]='E';break;
32         case 15:b[i]='F';break;
33     }
34               
35     printf("%2d进制:", n);
36     for(N=i-1;N>=0;N--)
37     printf("%X" ,b[N]);
38     printf("\n");
39 
40 }

 

posted on 2021-04-25 17:16  wyfaa  阅读(107)  评论(3编辑  收藏  举报