实验3

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

void print_text(int line, int col, char text[]);
void print_spaces(int n);
void print_blank_lines(int n);

int main()
{
    int line, col, i;
    char text[N] = "hi,November~";

    srand(time(0));

    for (i = 1; i <= 10; ++i) {
        line = rand() % 25;
        col = rand() % 80;
        print_text(line, col, text);
        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_text(int line, int col, char text[]) {
    print_blank_lines(line - 1);
    print_spaces(col - 1);
    printf("%s",text);
}

#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>
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>
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 x){
    static long long m;
    if (x == 1)
        return 1;
    else
        m = 2 * func(x - 1) + 1;
    return m;


}

#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 a, int b) {
    static int x;
    if (b == 0 || a == b)
        return 1;
    else if (a < b)
        return 0;
    else
        x = func(a - 1, b) + func(a - 1, b - 1);
    return x;

}

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

#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=0;
int main()
{
    unsigned int n;
    while (scanf_s("%u", &n) != EOF) {
        hanoi(n, 'A', 'B', 'C');
        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++;
    }

#include<stdio.h>
int is_prime(int n);
int main() {
    int n, x, y, p, q;
    while (scanf_s("%d", &n) != EOF) {
        for (x = 3; x <= n / 2; x++)
        {
            p = is_prime(x);
            if (p == 1) {
                for (y = n / 2; y < n; y++) {
                    q = is_prime(y);
                    if ((q == 1) && (n == x + y)) {
                        printf("%d=%d+%d\n", n, x, y);
                    }
                }
            }
        }
    }
    return 0;
}
int is_prime(int n) {
    int i;
    for (i = 2; i <= n / 2; i++) {
        if (n % i == 0) {
            return 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 x) 
{
 int  m[100], i=0, n, a, j = 0;
    while (x != 0)
    {
        a = x % 10;
        x = x / 10;
        if (a % 2 != 0)
        {
            m[i] = a;
            i++;
        }
    }
    for (n = i-1; n >= 0; n--)

        {
                 j=m[n]+j*10;
        }
        
    
        
    
    return j;
}