实验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,April~";

    srand(time(0));

    for(i=1;i<=10;++i)
    {
        line=rand()%25;
        col=rand()%80;
        print_text(line,col,text);
        Sleep(1000);
    }
    system("pause");
    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>
#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));

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

#include <stdio.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, func(n, m));

    return 0;
}

int func(int n, int m){
    int i,j,up,down,ans;
    for(i=n,up=1;n>=i-m+1;n--)
     up=up*n;
    for(j=1,down=1;j<=m;j++)
     down=down*j;
     ans=up/down;
     return ans;
}

#include <stdio.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, func(n, m));
    
    return 0;
}

int func(int n, int m){

#include <stdio.h>
#include<math.h>

void hanoi(unsigned int n,char from,char temp,char to);
void moveplate(unsigned int n,char from,char to);
int main()
{
    unsigned int n;
    while(scanf("%u",&n)!=EOF)
    {
        int m;
        hanoi(n,'A','B','C');
        m=pow(2,n)-1;
        printf("\n一共移动了%d次.\n\n",m);
    }
    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)
{
    printf("%u:%c --> %c\n",n,from,to);
}

#include <stdio.h>
#include <math.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){
    long ans;
    long digit,t;
    ans=0;
    t=1; 
    while(s>0){
        digit=s%10;
        if(digit%2!=0){
            ans+=t*digit;
            t*=10;
        }
        s/=10;
    }
    return ans;
}

 

int ans;
        if(m>n)
        ans=0;
        else if(m==n||m==0)
        ans=1;
        else
        ans=func(n-1,m)+func(n-1,m-1);
        return ans;
}