实验3

#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>
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;
    printf("p = %lld\n",p);
    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 ;
}

 

#include<stdio.h>
void printsymbol(int n, char symbol);

int main()
{
    int n ;
    char symbol;
    
    while (scanf("%d %c",&n,&symbol)!=EOF)
    {
        
        printsymbol(n,symbol);
        printf("\n");
    }
    return 0;
}
void printsymbol(int n, char symbol)
{
    int i;
    for(i = 1; i<= n;++i)
    printf("%c",symbol);
    
}

#include<stdio.h>
void printsymbol(int n, char symbol);

int main()
{
    int n ;
    char symbol;
    
    while (scanf("%d %c",&n,&symbol)!=EOF)
    {
        
        printsymbol(n,symbol);
        printf("\n");
    }
    return 0;
}
void printsymbol(int n, char symbol)
{
    
    printf("%c",symbol);
    if ( n!=1)
    printsymbol(n-1,symbol);
    
}

#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)
 {
     int i;
     long long f = 1,s;
     for(i = 1;i<=n;++i)
     {
         f = f*2;
     }
     s = f - 1;
     return s;
 }
    

 

#include<stdio.h>
#include<math.h>
int isprime(int n);
int main()
{
    int i,a = 0;
    for(i = 101;i<=200;i++)
    {
        if(isprime(i)){
        
        a = a + 1 ;
        printf("%4d",i);
    }
    }
    printf("\n");
    printf("101~200之间一共有%d个非素数",a);
    return 0;

}
int isprime(int n)
{
    int k;
    for(k = 2;k<=sqrt(n);k++)
    if(n%k==0)
    return 1;
    return 0;
    
    
}

 

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

int main()
{
    long s,t;
    
    printf("Enter a number:");
    while (scanf("%ld",&s)!=EOF)
    {
        t = fun(s);
        printf("new number is: %ld\n\n",t);
        printf("Enter a number: ");
    }
    return 0;
}
long fun(long s)
{
    int m,n,a=0,i,q = 0;
while(s!=0)
{
    m = s%10;
    s = s/10;
    if (m%2!=0)
    {
    n = m;
    a = a*10 + n;}
    
    }    
    
    while(a!=0)
    {
        i = a%10;
        a = a/10;
        q = q*10 + i;
    }
    return q;
    
}

 

#include<stdio.h>
#include<math.h>
double fun(int n);
int jiecheng(int n);
int main()
{
    int n;
    double s;
    
    printf("Enter n(1~10):");
    while (scanf("%d",&n) != EOF)
    {
        s = fun(n);
        printf("n = %d,s = %f\n\n",n,s);
        printf("Enter n(1~10)：");
        
    }
    return 0; 
}
double fun(int n)
{
    double a;
    if (n==1)
    return 1;
    else
    a = fun(n-1)+1/double(jiecheng(n))*pow(-1,n-1);
    return a;    
    }
int jiecheng(int n)
{
    if (n==0)
    return 1;
    else
    return n*jiecheng(n-1);
    
    
}