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

随机生成一个数a，然后空a取余25行空a取余80个空最后输入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;
    printf("%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;
}


//static再次进入函数时将使用上一次的结果

 

 

#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)
{
    if (n == 1)
        return 1;
    else
        return 2 * func(n - 1) + 1;
}

 

 

#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 t;
    
    if (n < m)
        return 0;
    if (n == m || m == 0)
        return 1;
    else
        t = func(n - 1, m) + func(n - 1, m - 1);
    return t;
}

 

 

#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 t;
    if (n == 0 || m == 0)
        return 0;
    if (n == 1)
        return m;
    if (m == 1)
        return n;
    else
    {
        t = mul(n - 1, m) + m;
        return t;
    }

}

 

 

#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 n4 = 0;
int main()
{
    unsigned int n;
    while (scanf_s("%u", &n) != EOF)
    {
        n4 = 0;
        hanoi(n, 'A', 'B', 'C');
        printf("一共移动了%d次", n4);
        system("pause");
    }
}
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)
{
    n4++;
    printf("%u:%c-->%c\n", n, from, to);
}

 

 

 1 #include<stdio.h>
 2 #include<cmath>
 3 int is_prime(int n)
 4 {
 5     int i;
 6     int t = 1;
 7     if (n < 2)
 8         t = 0;
 9     for (int i = 2; i <= sqrt(n); i++)
10     {
11         if (n % i == 0)
12         {
13             t = 0;
14             break;
15         }
16     }
17     return t;
18 }
19 
20 int main()
21 {
22     int n, m,j;
23     scanf_s("%d", &j);
24 
25     for (n = 2; n <= j / 2; n++)
26     {
27         m = j - n;
28         if ((is_prime(n)) && (is_prime(m)))
29             printf("%d=%d+%d\n", j, n, m);
30     }
31 }

 

 

 1 #include <stdio.h>
 2 long fun(long s)
 3 {
 4     int num[100];
 5     int i, j, m ,n ;
 6     i = -1;
 7     j = s;
 8     n = 0;
 9     while (j!= 0)
10     {
11         if (j % 2 == 1)
12             {
13                 i++;
14                 num[i] = j % 10;
15             }
16         j=j / 10;    
17     }
18     for (m = i; m >= 0; m--)
19     {
20         n = n * 10 + num[m];
21     }
22     return n;
23 }
24 int main() {
25     long s, t;
26     printf("Enter a number: ");
27     while (scanf_s("%ld", &s) != EOF) {
28         t = fun(s); 
29         printf("new number is: %ld\n\n", t);
30         printf("Enter a number: ");
31     }
32     return 0;
33 }