实验三

#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("%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;
}

#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<stdlib.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  sum;
    if (n == 0)
        sum = 0;
    else {
        sum = (func(n-1) + 1) * 2 - 1;
    }
    return sum;
}

第十一行 是ll 不是11！！！

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

    return sum;


}

#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)
{

        if (m == 0)
        return 0;

    else
        return n + mul(n, m - 1);

}

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

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

#include<stdio.h>
#include<stdlib.h>
int is_prime(int n);

int main()
{
    int i, a, b;
    for (i = 1; i <= 20; ++i)
    {
     if (i % 2 == 0){
     
     for (a = 2; a < i; a++){
        b = i - a;
        if (is_prime(b) && is_prime(a) && b != 0){
        printf("%d=%d+%d\n", i, a, b);
        
       break;
        
        
        }
        }

        }
        else continue;
    }
}
int is_prime(int n)
{
    int i;
    for (i = 2; i < n; ++i)
        if (n % i == 0)
            break;
    if (i == n)
        return 1;
    else
        return 0;
}

#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
long func(long s);

int score1[100];
int score2[100];
int main()
{
    long s, t;

    printf("Enter a number:");
    while (scanf_s("%ld", &s) != EOF)
    {
        t = func(s);
        printf("new number is:%ld\n\n", t);
        printf("Enter a number:");
    }
    return 0;
}


long func(long s)
{
    int  i = 0, m = 0, x = 0;
    int n, t;

    do
    {
        score1[i] = s % 10;
        s = (s - score1[i]) / 10;
        i++;
    } while (s - score1[i] != 0);
    for (t = 0; t <= i; t++)
    {
        if (score1[t] % 2 == 1)
        {
            score2[m] = score1[t];
            m++;
        }
    }
    for (n = 0; n <= m; n++)
        x = x + score2[n] * pow(10, n);
    return x;
}