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

long long fun(int n)
{
    long long x;
    if(n==0) x=1;
    else
    {
        x=2*fun(n-1);
    } 
    return x;

} 

 

 

#include<stdio.h>
#include<math.h>

int isPrime(int );

int main()
{
    int n,i,x=0;
    for(n=101;n<=200;n++)
    {
        i=isPrime(n);
        if(i==1) 
        {
            printf("%6d",n);
            x=x+1;
            if(x%10==0) printf("\n");
        }
        
        
    }
    printf("\n101~200中一共有%d个非素数",x);
    return 0;
}

int isPrime(int x)
{
    int i;
    for(i=2;i<=sqrt(x);i++)
    {
        if(x%i==0) return 1; 
    }
    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)
{
    int x,i=0;
    long q=0;
    while(s!=0)
    {
        x=s%10;
        if(x%2!=0)
        {
            q=q+x*pow(10,i);
            i=i+1;
        }
        else;
        s=s/10;
    }
    return q;
}

 

 

#include<stdio.h>
#include<math.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 t=0;
    double x=1;
    for(i=1;i<=n;i++)
    {
        x=x*i;
        t=pow(-1,i-1)*1/x+t;
    }
    return t;
}

 

 本次实验对于递归与迭代进行了进一步的学习，了解了两者之间的差距与区别