实验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;
    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)
{
    if(n==1)
    printf("%c",symbol);
    else
    {
        printf("%c",symbol);
        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)
{
    if(n==1)
    return 1;
    else
    return 2*fun(n-1)+1;
}

 

#include<math.h>
int isPrime(int n);
int main()
{
    int a,n,p=0;
    for(n=101;n<=200;++n)
    {
        a=isPrime(n);
        if(a=1)
        {
            p++;
            printf("%d ",n);
            if(p%10==0)
            printf("\n"); 
        }   
    }
    printf("总个数为：%d",p);
    return 0;
}
int isPrime(int n)
{
    int s;
    for(s=1;s<=sqrt(n);++s)
    {
        if(n%s==0)
        return 1;
        break;
    }return 0;
}

 

#include<stdio.h>
#include <math.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)
{
    long sum;
    int k;
    int n=0; 
    while(s!=0)
    {
        k=s%10;
        s=s/10;
        if(k%2!=0)
        {
            n++;
            sum=k*pow(10,n-1)+sum;
        }
    }
    return sum;
}

 

#include<stdio.h>
double fun(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)
{
    int i;
    double p=-1,fun;
    for(i=1;i<=n;++i)
    {
        p=p/i*(-1);
        fun=fun+p;
    }
    return fun;
}