实验3

实验1

#include<stdio.h>
#include<stdlib.h>
#include<time.h>
#include<windows.h>
#define N 80

void print_test(int line, int col, char test[]);
void print_spaces(int n);
void print_blank_lines(int n);
int main()
{
    int line, col, i;
    char test[N] = "hi,November";

    srand(time(0));

    for (i = 1; i <= 10; i++)
    {
        line = rand() % 25;
        col = rand() % 80;
        print_test(line, col, test);
        Sleep(1000);
    }
    return 0;
}
void print_spaces(int n)
{
    int i;
    for (i = 1; i <= n; i++)
        printf("  ");
}
void print_blank_lines(int n)
{
    int i;
    for (i = 1; i <= n; i++)
        printf("\n");
}
void print_test(int line, int col, char test[])
{
    print_blank_lines(line - 1);
    print_spaces(col - 1);
    printf("%s", test);
}

实验2

#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;
}

 实验3

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

实验4

#include<stdio.h>
int func(int n, int m);
int main()
{
    int n, m;
    while (scanf_s("%d%d", &n, &m) != EOF)
        printf("n=%d,m=%d,ans=%d\n", n, m, func(n, m));
    return 0;
}
int func(int n, int m)
{
    int result;
    if (m == 0||m==n)
        result = 1;
    else if (m > n)
        result = 0;
    else
        result = func(n - 1, m) + func(n - 1, m - 1);
    return result;
}

 

实验5

#include<stdio.h>
int mul(int n,int m);
int main()
{
    int n,m;
    while(scanf("%d%d",&n,&m)!=EOF)
    printf("%d*%d=%d\n",n,m,mul(n,m));
    return 0;
}
int mul(int n,int m)
{
    int i,t,result=0;
    if(n<m)
    {
        t=n;n=m;m=t;
    }
    for(i=1;i<=m;i++)
    {
        result+=n;
    }
    return result;
}

实验6

 

#include<stdio.h>
#include<stdlib.h>
void hanoi(unsigned int n, char from, char temp, char to);
void moveplate(unsigned int n, char from, char to);
int x;
int main()
{
    unsigned int n;
    while (scanf_s("%u", &n) != EOF)
    {
        hanoi(n, 'A', 'B', 'C');
        printf("\n");
        printf("一共移动了%d次\n", x);
        x = 0;
        system("pause");
    }
    return 0;
}
void hanoi(unsigned int n, char from, char temp, char to)
{
    if (n == 1)
        moveplate(n, from, to);
    else
    {
        hanoi(n - 1, from, to, temp);
        moveplate(n, from, to);
        hanoi(n - 1, temp, from, to);
    }
}
void moveplate(unsigned int n, char from, char to)
{
    printf("%u:%c-->%c\n", n, from, to);
    x++;
}

 实验7

#include<stdio.h>
#include<stdlib.h>
#include<math.h>
int is_prime(int n);
int main()
{
    int i, j, m;
    for (i = 1; i <= 20; i++)
    {
        if (i % 2 == 0)
        {
            for (j = 1; j < i; j++)
            {
                m = i - j;
                if (is_prime(m) && is_prime(j) && m != 0)
                {
                    printf("%d=%d+%d\n", i, j, m);
                    break;
                }
            }
        }
        else continue;
    }
}
int is_prime(int n)
{
    int k;
    for (k = 2; k < n; k++)
        if (n % k == 0)
            break;
    if (k == n)
        return 1;
    return 0;
}

实验8

#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)
{
    int ans[100], i, t = 0, j, a;
    long sum = 0;
    for (i = 0; i <= 100; i++)
    {
        a = s % 10;
        s = s / 10;
        if (a % 2 == 1)
        {
            ans[t] = a;
            t++;
        }
        else continue;
    }
    for (j = t - 1; j >= 0; j--)
    {
        sum = sum * 10 + ans[j];
    }
    return sum;
}