实验3
task1.c #include<stdio.h> #include<stdlib.h> #include<time.h> #include<windows.h> #define N 80 void printText(int line,int col,char text[]); void printSpaces(int n); void printBlankLines(int n); int main() { int line,col,i; char text[N]="hi,May~"; srand(time(0)); for(i=1;i<=10;++i) { line=rand()%25; col=rand()%80; printText(line,col,text); Sleep(1000); } return 0; } void printSpaces(int n) { int i; for(i=1;i<=n;++i) { printf(" "); } } void printBlankLines(int n) { int i; for(i=1;i<=n;++i) { printf("\n"); } } void printText(int line,int col,char text[]) { printBlankLines(line-1); printSpaces(col-1); printf("%s",text); }
根据当前的时间随机生成对应的行和列,并在该位置打印hi may。
task2.1.c #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; }

task2.2.c #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; }

task3.c #include<stdio.h> long long fun(int n); int main() { int n; long long f; while(scanf("%d",&n)!=EOF) { f=fun(n); printf("n=%d,f=%lld\n",n,f); } return 0; } long long fun(int n) { int i; long int p=1; for(i=1;i<=n;++i) { p=p*2; } p=p-1; return p; }

task.4.c #include<stdio.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; int i; while(scanf("%u",&n)!=EOF) { hanoi(n,'A','B','C'); printf("\n"); printf("一共移动了%d次.\n\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); }

尝试了许多i都不会:(
task5.c #include<stdio.h> void is_prime(); int main() { int n; int i,j,k; i=is_prime(n); for(k=4;k<=20;k+=2) { i+j=k; printf("%d=%d+%d\n",k,i,j); } return 0; } void is_prime(n) { int m,h; for(n=2;n<=20;n++) { if(n==2) h=n; for(m=2;m<n;++m) { if(n%m==0) break; else h=n; } } return h; }
代码错了,但不知道为什么。。。
task6.c #include<stdio.h> long fun(long s); int main() { long s,t; printf("Enter a number:"); while(scanf("%ld",&s)!=EOF) { t=fun(s); printf("new number is:%ld\n\n",t); printf("Enter a number:"); } return 0; } long fun(long s) { int i,j; long int n=1,m=0; while(s>0) { j=s%10; if(j%2==1) { m=m+j*n; n*=10; } s/=10; } return m; }

浙公网安备 33010602011771号