实验三

#include<stdio.h>
#include<windows.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!=%11d\n",i,fac(i));
    system("pause");
    return 0;
}
long long fac(int n)
{
    static long long p=1;
    p=p*n;
    return p;
}

 

 

#include<stdio.h>
#include<Windows.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,p1);
    system("pause");
    return 0;
}
int func(int a,int b)
{
    static int m=0,i=2;
    i+=m+1;
    m=i+a+b;
    return m;
}

 

 

#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<Windows.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");
    }
    system("pause");
    return 0;
}
void printSymbol(int n,char symbol)
{
    int i;
    for(i=1;i<=n;i++)
        printf("%c",symbol);
}

 

 

#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<Windows.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");
    }
    system("pause");
    return 0;
}
void printSymbol(int n,char symbol)
{
    if(n==1)
        printf("%c",symbol);
    else
    {
        printSymbol(n-1,symbol);
        printf("%c",symbol);
    }
}

 

 

#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<Windows.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)
{
    long long f;
    if(n==0)
        f=0;
    else
        f=(fun(n-1)+1)*2-1;
    return f;
}

 

 

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

 

 

#define _CRT_SECURE_NO_WARNINGS
#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("nuw number is:%ld\n\n", t);
        printf("Enter a number:");
    }
    return 0;
}
long fun(long s)
{
    int j, n,k,i;
    n = 0;
    k = 0;
    while(s>0)
    {
        j = s % 10;
        if (j % 2 != 0)
            n++;
        if (j % 2 == 0)
            j = 0;
        for (i = 1; i <= n-1 ; i++)
            j = j * 10;
        k += j;
        s = s / 10;
    } 
    return k;
}

 

 

#define _CRT_SECURE_NO_WARNINGS
#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 sign,i,j,h;
    double s;
    s = 0;
    h = 1;
    sign = 1;
    j = 1;
    for (i = 1; i <= n; i++)
    {
        j = j * i;
        s += sign * (double)1 / j;
        sign = -sign;
    }
    return s;
}