实验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", n,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", n, 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>
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 i,j=1;
    for (i = 1; i <= n; i++)
    {
        j *= 2;
    }
    j = j - 1;
    return j;
}

#include<stdio.h>
int func(int n, int m);
long long fac(int a);
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 b;
    b = fac(n) / (fac(m) * fac(n - m));
    return b;
}
long long fac(int a)
{
    long long i,j=1;
    for (i = 1; i <= a; i++)
    {
        j = j * i;
    }
    return j;
}

#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 n, int m)
{
    int i,j=0;
    for (i = 1; i <= n; i++)
    {
        j += m;
    }
    return j;
}

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

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

}
int is_prime(int n) {

    int i = 2;

    for (i = 2; i <= sqrt(n * 1.0); i++)
    {
        if (n % i == 0)
            break;
    }
    if (i > sqrt(n * 1.0))
        return 1;

    else return 0;

}

#include<stdio.h>
#include<math.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 a,b=0,c=0;
    a = s;
    c = s % 10;
    if (a != 0)
    {
        if (c % 2 == 1)
        {
            b = c + fun(s / 10) * 10;
        }
        else
            b = fun(s / 10);
    }
    return b;
}