实验四

#include <stdio.h>
long long fun(int n);   

int main() {
    int n;
    long long f;
    
    while(scanf("%d", &n) != EOF) {
        f = fun(n);  
        printf("n = %d, f = %lld\n", n, f);
    }
    
    return 0;
}
long long fun(int n){

 if(n==1){
     return 1;
 }
 else{
 
   return 2*fun(n-1)+1;}
}
 

#include <stdio.h>

void draw(int n, char symbol);  // 函数声明 

#include <stdio.h> 
int main() {
    int n, symbol;
    
    while(scanf("%d %c", &n, &symbol) != EOF) {
        draw(n, symbol);  // 函数调用 
        
        printf("\n");
    }
    
    return 0;
} 


// 函数定义
void draw(int n,char symbol)
{
    int line,i,j;
    for(line=1;line<=n;line++)
    {
        for(i=1;i<=n-line;i++)
            printf("%c",' ');
        for(i=n-line+1;i<n+line;i++)
            printf("%c",symbol);
        printf("\n");
    }
}

ex1

可以

ex2

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

　　

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

ex3

#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; //1  
        for(i=2;i<j;i++)
            if(j%i==0) {  //2 
               flag=0;
               break;
        }
        if(i>=j) //3 
           bb[k++]=j;
    }
    return k;
}

int main(){
    int n=0,m=0,i,k,bb[N];
    
    scanf("%d",&n);
    scanf("%d",&m);
    
    for(i=0;i<m-n;i++)
        bb[i]=0;
        
    k=fun(n,m,bb); //4 
    
    for(i=0;i<k;i++)
        printf("%4d",bb[i]);
        
    return 0;
}