实验三

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

程序功能：在任意一行的任一列打印hi november

#define _CRT_SECURE_NO_WARNINGS 1
#include<stdio.h>
#include<stdlib.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 1
#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 使变量在此函数之中的值不会受其他函数影响

#define _CRT_SECURE_NO_WARNINGS 1
#include <stdio.h> 
#include<stdlib.h>
long long func(int n); 

int main() 
{ 
    int n; long long f; 
    while (scanf("%d", &n) != EOF)
    { 
        f = func(n); 
        printf("n = %d, f = %lld\n", n, f);

    }
    return 0;
}

long long func(int n) 
{
    int ans = 1;
    int i;int f;
    for (i = 1; i <= n; ++i)
    {

        ans = 2 * ans;
    }
    f = ans - 1;
    return f;

}

#define _CRT_SECURE_NO_WARNINGS 
#include <stdio.h> 
#include<stdlib.h>
int func(int n, int m);
int main() {
    int n, m;

    while (scanf("%d%d", &n, &m) != EOF)
        printf("n = %d, m = %d, ans = %d\n", n, m, n, m, func(n, m));
  
    return 0;

}


int func(int n, int m)
{
    int i;
    
    if (n == m || m == 0)
        return 1;
    
    if (n < m)
        return 0;
   
    else
        i = func(n - 1, m) + func(n - 1, m - 1);
    return i;
}

#define _CRT_SECURE_NO_WARNINGS 
#include <stdio.h> 
#include<stdlib.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 t;
       
        
        if (m == 0)
            return 0;
        
        else
            return n + mul(n, m - 1);

}

#define _CRT_SECURE_NO_WARNINGS 
#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 = 0;

int main()
{
    unsigned int n;
    while (scanf("%d", &n) != EOF)
    {
        hanoi(n, 'A', 'B', 'C');
        printf("\n");
        printf("共%d次", 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);
}

#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
int is_prime(unsigned int n);

int main()
{
    int i, p, q, x, y;
    unsigned int n;
    while (scanf("%d", &n) != EOF)
    {
        if (n % 2 !=0 || n < 2)
        {
            printf("请输入一个偶数");
            return 0;
        }
        p = 1;
        do
        {
            p = p + 1;
            q = n - p;
            x = is_prime(p);
            y = is_prime(q);
        }  while (x * y == 0);
        printf("%d=%d+%d\n", n, p, q);
    }
    return 0;
}

int is_prime(unsigned int n)
{
    int i, m;
    m = sqrt(1.0 * n);
    for (i = 2; i <= m; i++)
        if (n % i == 0)
            break;
    if (i > m )
        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;
}