实验任务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);//暂停1000ms } system("pause"); return 0; } //打印n个空格 void print_spaces(int n){ int i; for(i=1;i<=n;++i) printf(" "); } //打印n行空白行 void print_blank_lines(int n){ int i; for(i=1;i<=n;++i) printf("\n"); } //在第line行第col列打印一段文本 void print_text(int line,int col,char text[]){ print_blank_lines(line-1);//打印(line-1)行空行 print_spaces(col-1);//打印(col-1)列空格 printf("%s",text);//在第line行、col列输出text中的字符串 }
回答:在随机屏幕随机位置打印出10个字符“hi,April"。
实验任务2
task2_1:
程序代码:
//利用static变量的特性,计算阶乘 #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; p=p*n; return p; }
//利用static变量的特性,计算阶乘 #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; }
运行结果:
task2_2:
程序代码:
//练习:局部static变量特性 #include <stdio.h> #include <stdlib.h> int func(int a,int b);//函数声明 int main(){ int k=4,m=1,p1,p2; p1=func(k,m);//函数调用 p2=func(k,m);//函数调用 printf("%d,%d\n",p1,p2); system("pause"); 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> #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); } system("pause"); return 0; } long long func(int n){ int i; long long m=1; for(i=1;i<=n;++i) m*=2; return m-1; }
运行结果:
实验任务4
程序代码:
#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,func(n,m)); system("pause"); return 0; } int func(int n,int m){ if(m==1) return n; else{ if((m==n)||(m==0)) return 1; else{if (m>n) return 0; else return func(n-1,m)+func(n-1,m-1); }}}
运行结果:
实验任务5
task5_1:
程序代码:
#include <stdio.h> #include <stdlib.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); } system("pause"); return 0; } double mypow(int x,int y){ int i; double m=1.0; if(y==0) m=m; else{if(y>0){for(i=1;i<=y;i++){ m*=x;}} else{ for(i=1;i<=-y;i++){ m*=x;} m=1.0/m;}} return m;}
运行结果:
task5_2:
程序代码:
#include <stdio.h> #include <stdlib.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); } system("pause"); return 0; } double mypow(int x,int y){ int i; double k; if(y==0) return 1; else{if(y==1) return x; else{if(y>0) return mypow(x,y-1)*x; else {i=-y; k=mypow(x,i-1)*x; return 1.0/k;}}}}
运行结果:
实验任务6
程序代码:
#include <stdio.h> #include <stdlib.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() {int m; unsigned int n; while(scanf("%u",&n)!=EOF){ m=pow(2,n)-1; hanoi(n,'A','B','C'); printf("\n一共移动了%d次\n",m);} system("pause"); return ; } 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);}
运行结果:
实验任务7
程序代码:
#include <stdio.h> #include <stdlib.h> int is_prime(int a); int main(){ int n,m,i,j,k; for(n=4;n<=20;n++){ for(i=2,j=2;!is_prime(i-1)||!is_prime(j);i++) j=n-i; printf("%d=%d+%d\n",n,i-1,j); n++;} system("pause"); return 0;} int is_prime(int a){ int k,m=0; if(a==1) return 0; else{for(k=2;k<a;k++){ if(a%k==0) {m=1;break;} else m=0;}} if (m==1) return 0; else return 1;}
运行结果:
实验任务8
程序代码:
#include <stdio.h> #include <stdlib.h> #include <math.h> long func(long s); int main(){ long s,t,i,m,n,k; printf("Enter a number:"); while(scanf("%ld",&s)!=EOF){ t=func(s); printf("new number is:%ld\n\n",t); printf("Enter a number:"); } system("pause"); return 0; } long func(long s){long i,n,k,m=0; for(i=s,k=0;i>0;k++){ n=i%10; i=i/10; if ((n%2==0)||n==0) k--; else m=m+n*(pow(10,k));} return m;}
运行结果:
标签:return,int,long,实验,func,printf,include From: https://www.cnblogs.com/moreless-xu/p/17272079.html