实验三

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

#include <stdio.h>
#include <stdlib.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 jc(int n)
{
    int a=1;
    int i;
    for(i=1;i<=n;++i)
    {
        a*=i;
    }
    return a;
}
int func (int n,int m)
{
    int C;
    C=jc(n)/(jc(m)*jc(n-m));
    return C;
}*/
int func(int n, int m)
{
    if (m == n || m == 0)
        return 1;
    else if (n < m)
        return 0;
    else
        return func(n - 1, m) + func(n - 1, m - 1);
}

#include <stdio.h>
#include <stdlib.h>
void haino(unsigned int n,char from,char temp,char to);
void moveplate(unsigned int n,char from,char to); 
int main()
{
    unsigned int n;
    int num;
    scanf ("%u",&n);
    haino (n,'A','B','C');
    printf("%d",num=2^n-1);
    return 0;
}
void haino(unsigned int n,char from,char temp,char to)
{
    if (n==1)
        moveplate (n,from,to);
    else
    {
        haino(n-1,from,to,temp);
        moveplate(n,from,to);
        haino(n-1,temp,from,to);
    }
}
void moveplate(unsigned int n,char from,char to)
{
    printf("%u:%c-->%c\n",n,from,to);
}

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

 

#include <stdio.h>
#include <stdlib.h>
long func(long s);
int main ()
{
    long s,t;
    printf("Enter a number:");
    while(scanf("%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 a,b;
     a = 0;
     while(s != 0){
         a = s%10;
         if(a % 2 != 0)
         b = 10*b + a;
         s /= 10;
              }
     int c,d;
     d = 0;
     while(b != 0){
         c = b%10;
         d = 10*d + c;
         b /= 10;
         
     }
     return d;
 }