实验三
实验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,April~"; 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); }
程序实现的功能：每隔1000ms在屏幕的随机行列处打出“hi,April~”
实验二
#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!=%11d\n",i,fac(i)); return 0; } long long fac(int n){ static long long p=1; p=p*n; return p; }
#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!=%11d\n",i,fac(i)); return 0; } long long fac(int n){ static long long p=1; printf("p=%11d\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变量的特性：在下一次调用的时候还可以保持原来的赋值。
实验3
#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) { int f,m; for(m=1;m<=n;m++) f=2*f+1; return f; }
实验四
#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) { if(m==0){return 1;} else if(m==n){return 1;} else if(m>n){return 1;} else {return func(n-1,m)+func(n-1,m-1);} }
实验五
#include<stdio.h> double mypow(int x,int y); int main(){ int x,y; double ans; while(scanf("%d%d",&x,&y)!=EOF){ ans=mypow(x,y); printf("%d的%d次方：%g\n\n",x,y,ans); } return 0; } double mypow(int x,int y) {int m,i; double n=1; if(x==1){return 1; } if (y>=0){ for(i=0;i<y;i++){ m=x; n=n*x;} } else{y=-y; for(i=0;i<y;i++) { m=x; n=n/m;} } return n;}
#include<stdio.h> double mypow(int x,int y); int main(){ int x,y; double ans; while(scanf("%d%d",&x,&y)!=EOF){ ans=mypow(x,y); printf("%d的%d次方：%g\n\n",x,y,ans); } return 0; } double mypow(int x,int y){ double n; if (y==0) {n=1;} else if(y>0) {n=x*mypow(x,y-1);} else if(y<0) {n=mypow(x,y+1)/x; } return n; }
实验六
#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,i; while(scanf("%u",&n) != EOF) { hanoi(n,'A','B','C'); i=pow(2,n)-1; printf("\n一共移动了:%d次\n",i); } 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<stdlib.h> #include<math.h> int is_prime(int n); int main() { int n,p,q,flagp,flagq; for(n=4;n<=20;n+=2) {p=1; do{ p++; q=n-p; flagp=is_prime(p); flagq=is_prime(q); } while(flagq*flagp==0); printf("%d=%d+%d\n",n,p,q); } return 0; } int is_prime(int n){ int k; for(k=2;k<=sqrt(n);k++) if(n%k==0) { return 0; } return 1; }
实验八
#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) { int a,b,c; b=0; c=1; while(s!=0) { a=s%10; if(a%2==0) { b=b; } if(a%2==1) { b=b+a*c; c=c*10; } s=s/10; } return b; }
