3

#include <stdio.h>
long long fac(int n); 
int main()
{
    int i, n;
    printf("Enter n: ");
    scanf_s("%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_s("%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_s("%d %c", &n, &symbol) != EOF)

    {
        printsymbol(n, symbol);
        printf("\n");

    }
    return 0;
}
void printsymbol(int n, char symbol)

{
    int i;
    for (i = 0; i < n; i++)
        printf("%c", symbol);
    return;

}

 

 

#include<stdio.h>
void printsymbol(int n, char symbol);
int main()
{
    int n;
    char symbol;
    while (scanf_s("%d %c", &n, &symbol) != EOF)

    {
        printsymbol(n, symbol);
        printf("\n");

    }
    return 0;
}
void printsymbol(int n, char symbol)
{
    while (n != -1)
    {
        if (n != 0)
        {
            printf("%c", symbol);
            n--;
        }
        else
            n = -1;
    }
}

 

 

#include <stdio.h>
long long fun(int n); 
int main()
{
    int n;
    long long f;
    while (scanf_s("%d", &n) != EOF)
    {
        f = fun(n); 
        printf("n = %d, f = %lld\n", n, f);
    }
    return 0;
}
long long fun(int n)
{
    int t;
    if (n == 1)
        t = 1;
    else
        t = fun(n - 1) * 2 + 1;
    return t;
}

 

 

#include <stdio.h>
int isprime(int n);
int main()
{
    int a=0, i;
    for (i = 101; i < 201; i++)
    {
        if (!isprime(i)) 
        {
            printf("%d ", i);
            a++;
            while (a % 10 == 0 && a != 0) 
            {
                printf("\n"); break;
            }
        }
    }
    printf("\n101~200之间一共有%d个非素数", a);
    return 0;
}
int isprime(int n) {
    int i;
    for (int i = 2; i < (n + 4) / 2; i++)
    {
        if (n == 2)
            return 1;
        else if (n % i == 0) 
        {
            return 0;
            break;
        }
        if (i == (n + 4) / 2 - 1 && n % i != 0) 
        {
            return 1;
        }
    }
}

 

 

#include <stdio.h>
long fun(long s); 
int main()
{
    long s, t;
    printf("Enter a number: ");
    while (scanf_s("%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 m, n=0;
    long i = 1;
    while (s > 0)
    {
        m = s % 10;
        if (m % 2 != 0)
        {
            n = n + m * i;
            i = i * 10;
        }
        s = s / 10;
    }
    return n;
}

 

 

#include <stdio.h>
double fun(int n); 
int main()
{
    int n;
    double s;
    printf("Enter n(1~10): ");
    while (scanf_s("%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, a, b;
    double sum=0;
    a = 1;
    b = 1;

    for (i = 1; i <= n; i++)
    {
        b = b * i;
        sum = sum + 1.0 / b * a;
        a = a * (-1);
    }
    return sum;
}