


已阅读5页,还剩45页未读, 继续免费阅读
版权说明:本文档由用户提供并上传,收益归属内容提供方,若内容存在侵权,请进行举报或认领
文档简介
计算机应用实践报告机房名称 时 间8.24 至 9.4 学 院 专业班级 姓 名 学 号 指导教师 成 绩 2009 年 9 月说 明一、 计算机应用实践是本科教学重要的实践教学环节,是提高学生应用计算机能力的重要措施。所有参加计算机应用实践教学活动的学生都必须撰写实践报告二、 计算机应用实践报告的质量反映了计算机应用实践的教学质量,它是评定计算机应用实践成绩的主要依据之一。不交实践报告者不得参加实习成绩评定。三、 指导教师必须对学生的实践报告写出评语并在相应位置给出成绩并签字,否则本实践报告无效。四、 实践报告要求条理清晰,内容详尽,数据准确,字数不少于5000字。五、 计算机应用实践活动结束后请将本报告上交学院存档保存。计算机应用实践报告平时程序清单1- 1main()float a,b; a=5.2; b=a*a; printf(b=%fn,b);1- 2int max(int x,int y)int z; if (xy) z=x;else z=y; return(z);main()int a,b,c; scanf(%d,%d,&a,&b); c=max(a,b); printf(max=%dn,c); 1- 3main()int a,b,t; scanf(%d,%d,&a,&b); if (ab) t=a;a=b;b=t; printf(a=%d b=%dn,a,b);2-1-1main()char c1,c2; c1=97;c2=98; printf(%c %cn,c1,c2); printf(%d %dn,c1,c2);2-1-2main()int c1,c2; c1=97;c2=98; printf(%c %cn,c1,c2); printf(%d %dn,c1,c2);2-1-3main()int c1,c2; c1=300;c2=400; printf(%c %cn,c1,c2); printf(%d %dn,c1,c2);2-2-1main()int i,j,m,n; i=8;j=10; m=+i;n=j+; printf(%d,%d,%d,%d ,i,j,m,n);2-2-2main()int i,j,m,n; i=8;j=10; m=i+;n=+j; printf(%d,%d,%d,%d ,i,j,m,n);2-2-3main()int i,j; i=8;j=10; printf(%d,%d ,i+,j+);2-2-4main()int i,j; i=8;j=10; printf(%d,%d ,+i,+j);2-2-5main()int i,j; i=8;j=10; printf(%d,%d,%d,%d ,i,j,i+,+j);2-2-6main()int i,j,m=0,n=0; i=8;j=10; m+=i+;n-=-j; printf(i=%d,j=%d,m=%d,n=%d,i,j,m,n);3-1main()int a,b; float d,e; char c1,c2; double f,g; long m,n; unsigned int p,q; a=61;b=62; c1=a;c2=b; d=3.56;e=-6.87; f=3157.890121;g=0.123456789; m=50000;n=-60000; p=32768;q=40000; printf(a=%d,b=%dnc1=%c,c2=%cnd=%6.2f,e=%6.2fn,a,b,c1,c2,d,e); printf(f=%15.6f,g=%15.12fnm=%ld,n=%ldnp=%u,q=%un,f,g,m,m,p,q);3-2main()int a,b; float d,e; char c1,c2; double f,g; long m,n; unsigned int p,q; a=61;b=62; c1=a;c2=b; f=3157.890121;g=0.123456789; d=f;e=g; p=a=m=50000;q=b=n=-60000; printf(a=%d,b=%dnc1=%c,c2=%cnd=%6.2f,e=%6.2fn,a,b,c1,c2,d,e); printf(f=%15.6f,g=%15.12fnm=%ld,n=%ldnp=%u,q=%un,f,g,m,m,p,q);3-3main()int a,b; float d,e; char c1,c2; double f,g; long m,n; unsigned int p,q; a=61;b=62; c1=a;c2=b; d=3.56;e=-6.87; f=3157.890121;g=0.123456789; m=50000;n=-60000; p=32768;q=40000; printf(a=%d,b=%dnc1=%c,c2=%cnd=%15.6f,e=%15.12fn,a,b,c1,c2,d,e); printf(f=%f,g=%fnm=%ld,n=%ldnp=%d,q=%dn,f,g,m,m,p,q); 3-4#include ;main()char c1,c2; c1=getchar(); c2=getchar(); putchar(c1); putchar(c2); printf(%c,c1); printf(%c,c2);4-1main()int a,b,c,min;scanf(%d,%d,%d,&a,&b,&c);if(ab) min=a;else min=b;if(cb) t=a;a=b;b=t; if (bc) t=b;b=c;c=t; if (ab) t=a;a=b;b=t; if (a+bc) printf(Cannot construct a trangle!n);goto end; t=(a=b)+(b=c)+(c=a); switch(t) case 0:printf(Three numbers are different!n);break; case 2:printf(Two numbers are the same!n);break; case 3:printf(Three numbers are the same!n);break; end:;4-4main()long a,b,c,d,e; scanf(%ld,&a); b=a*a; c=a;d=b; d=d-c; do c=c/10; e=d%10; d=d/10; while (c!=0&e=0); if (e!=0) printf(%ld no %ld*%ld=%ldn,a,a,a,b); else printf(%ld yes %ld*%ld=%ldn,a,a,a,b);4-5main()int a;scanf(%d,&a);switch(a) case 1:printf(January);break; case 2:printf(February);break; case 3:printf(March);break; case 4:printf(April);break; case 5:printf(May);break; case 6:printf(June);break; case 7:printf(July);break; case 8:printf(August);break; case 9:printf(September);break; case 10:printf(Octuber);break; case 11:printf(November);break; case 12:printf(December);break; default:printf(NO); 5.1main()int i,n; float t,s; s=0; scanf(%d,&n); for(i=1;i=n;i+) t=1.0/i; s=s+t; printf(s=%fn,s); 5.2main()int i,n;long s;s=1;printf(Please enter n:);scanf(%d,&n);for(i=1;i=n;i+)s=s*i;printf(s=%ld,s);5.3main()int a7; int sum,b,k; sum=0; for (a1=0;a12;a1+) for (a2=0;a22;a2+) for (a3=0;a32;a3+) for (a4=0;a42;a4+) for (a5=0;a52;a5+) for (a6=0;a62;a6+) for (a0=1;a023;a0+) b=a0; for (k=1;k=6;k+) sum=sum+b; if (ak=0) b=b+k;else b=b-k; sum=sum+b;if (sum=105) printf(%d ,a0);goto end;sum=0; end:;5.4main()int n,i,j,k; scanf(%d,&n); for (i=1;i=n;i+) for (j=1;j=3*(n-i);j+) printf( ); for (j=1;j=i;j+) if (j0;j-) if (j=1;i-) for (j=1;j=3*(n-i);j+) printf( ); for (j=1;j=i;j+) if (j0;j-) if(j10) printf(%d ,j);else printf(%d ,j); printf(n); 5.5#include #include int leap(int); int md(int m,int y); void prtweek(void); int fw(int m,int y); void prtmonth(int m); int main(int argc, char* argv) int y,m,i,test,week; printf(Year:); scanf(%d,&y); for (m=1; m=12; m+) test=1; prtmonth(m); prtweek(); week=fw(m,y); if (week!=6) for (i=0; i=week; i+) putchar(t); test+; for (i=1; i=md(m,y); i+,test+) printf(%dt,i); if (test%7=0) putchar(n); putchar(n); system(pause); return 0;int leap(int y) return (y%4=0&y%100|y%400=0)?1:0;int md(int m,int y) int d; switch (m) case 1: case 3: case 5: case 7: case 8: case 10: case 12:d=31;break; case 4: case 6: case 9: case 11:d=30;break; case 2:d=leap(y)?29:28;break; return d; void prtweek(void) printf(%st%st%st%st%st%st%stn,Sun,Mon,Tue,Wed,Thur,Fri,Sat); int fw(int m,int y) int f; if (m3) m+=12; y-; f=(1+2*m+3*(m+1)/5+y+y/4-y/100+y/400)%7; return f; void prtmonth(int m) switch (m) default: case 1:puts(=January=);break; case 2:puts(=February=);break; case 3:puts(=March=);break; case 4:puts(=April=);break; case 5:puts(=May=);break; case 6:puts(=June=);break; case 7:puts(=July=);break; case 8:puts(=August=);break; case 9:puts(=September=);break; case 10:puts(=October=);break; case 11:puts(=November=);break; case 12:puts(=December=);break; 6.1main()int s,n ; s=0; for(n=1;n=100;n+) if(n%3=0) s+=n; printf(%d,s); 6.2main()int i,j,k; for(i=1;i=5;i+) for (j=1;j=5-i;j+) printf( ); switch(i) case 1:printf(&n);break; case 2:printf(&n);break; default:printf(&); for (j=1;j=(i-2)*2-1;j+)printf( ); printf(&n); printf( );for (i=1;i=7;i+) printf(&);printf(n); for (i=1;i=9;i+) printf(&);printf(n);6.3#include main()char ch; ch=getchar(); while (ch!=n) if (ch=a&ch=A&ch=Z) switch(ch) case z:ch=a;break; case Z:ch=A;break; default:ch=ch+1; printf(%c,ch); ch=getchar(); 7.1#include main()char ch; ch=getchar(); while (ch!=n) if (ch=a&ch=A&ch=Z) switch(ch) case z:ch=a;break; case Z:ch=A;break; default:ch=ch+1; printf(%c,ch); ch=getchar(); 7.2main()int a34,i,j,t; for(i=0;i3;i+) for(j=0;j4;j+) scanf(%d,&aij) for(i=0;i3;i+) for(j=i+1;j4;j+) t=aij; aij=aji; aji=t; printf(%d,aji); 7.3main()int n,h=0; for(n=100;n=500;n+); if(prime(n) +h; printf(%d %d,n,h); int prime(int n) int flag=1,i; if(n=0)flag=0; for(i=2;i=n/2&flag=1;i+) if(n%i=0)flag=0; return(flag); 8.1#includemath.hmain()int a=0,k; float av; for(k=2;k=1000;k+) if(fun(k) a+=k; av=a/1000; printf(av=%fn,av); fun(int n) int i,y=0; if(i=0)y=1; for(i=2;i=n/2&y=0;i+) if(n%i=0)y=1; else y=0; return y; 8.2int flag;void Narsissus(int n)int i,j,k,sum; j=n; sum=0; for (i=1;i=100;i-) Narsissus(i); if (flag=2) break; 8.3#includestdio.hmain() int n,i; printf(n please input a number:); scanf(%d,&n); printf(%d=,n); for(i=2;i=n;i+) while(n!=i) if(n%i=0) printf(%d*,i); n=n/i; else break; printf(%d,n); getch(); 8.4#includeint main(void)int num;void Max(int n);cinnum;Max(num);void Max(int n)int i,j,k,temp,a4; for(i=0;i4;i+) ai=n%10; n/=10; for(i=0;i4;i+) k=i; for(j=i+1;jai)k=j; if(k!=i) temp=ai; ai=ak; ak=temp; for(i=0;i4;i+)coutai; coutendl; 8.5. #includevoid main() int i,a,b,c,d,t; for(i=1000;i=b&b=c&c=d) printf(%d %d %d %dn,a,b,c,d); 9.1main()int i,n,a10,av; for(i=0;in;i+) scanf(%d,ai) for(i=0;in;i+) printf(%d,ai); if (i%3=0) printf(n); for (i=0;i!=n;i+) av+=ai; printf(av=%fn,av);10.1main()int i,a10; float av; for(i=0;i10;i+) scanf(%d,&ai); for(i=0;i10;i+) printf(%d ,ai); if (i%3=2) printf(n); for (i=0;i!=10;i+) av+=ai; printf(av=%fn,av/10);10.2main()int a10; int i,j,k,l,m; for (i=0;i10;i+) scanf(%d,&ai); for (i=0;i9;i+) for (j=i+1;j10;j+) if (aiaj) m=ai;ai=aj;aj=m; for (i=0;i10;i+) printf(%d ,ai); printf(nPlease input a number: ); scanf(%d,&m); for (i=0;i=m&ai+1=m) printf(%d ,m); printf(n);10.3int a44;input()int i,j; for (i=0;i4;i+) for (j=0;j4;j+) scanf(%d,&aij);sum()int i,j,su; su=0;i=0; for (i=0;i4;i+); su=su+aii+ai3-i; printf(1)The sum=%dn,su);mutiply()int i,j,muti; printf(2)The mutiply=%dn,a00*a22);maxnum()int max,i,j,m,k; max=a00; for (i=0;i=3;i+) for (j=0;jmax) max=aij;m=i;k=j; printf(3)The maxnum=%d,max); printf( Its in Row %d Line %dn,m+1,k+1);main()input(); sum(); mutiply(); maxnum();10.4main()char ch2080; char c4; int lenmax,num,len,l; gets(ch1);len=1; lenmax=0; strcpy(c,stop); while (strcmp(chlen,c)!=0) l=strlen(chlen); if (llenmax) lenmax=l;num=len; gets(ch+len); puts(chnum);10.5main()int a11; int i,j,k; for (i=0;i=10;i+) ai=0; for (i=0;i50;i+) scanf(%d,k); ak/10+; a0=a0+a1+a2+a3; printf(0-39%dn,a0); printf(40-49%dn,a4); printf(50-59%dn,a5); printf(60-69%dn,a6); printf(70-79%dn,a7); printf(80-89%dn,a8); printf(90-100%dn,a9+a10);10.6main()int n,m,i,j,l,ll; int a1000; printf(Please input n,m: ); scanf(%d,%d,&n,&m); l=n*m; for (i=0;il;i+) scanf(%d,&ai); for (i=0;il-1;i+) for (j=i;jaj) ll=ai;ai=aj;aj=ll; for (i=0;il;i+) printf(%d ,ai); if (i+1)%m=0) printf(n); 11.1main()int a45; int i,j,k,l,m,n; for(i=1;i=3;i+) for(j=1;j=4;j+) scanf(%d,&aij); for(i=1;i=1;j-) for (i=1;i=3;i+) aij+1=aij; for (i=1;i=3;i+) ai1=ai0; printf(Its changed to:n); for(i=1;i=3;i+) for(j=1;j=4;j+) printf(%d ,aij); printf(n); 11.2#include main()char s280,ch80; int i,j,k; gets(s2); k=strlen(s2); i=0; while (s2i!=0)&(i=k) chi=s2i; i+; puts(ch);11.3main()int a100; int i,j,k,l,num,n,flag; printf(Please input n:); scanf(%d,&n); for (i=0;in;i+) scanf(%d,&ai); printf(Please input a num:); scanf(%d,&num); flag=0; for (i=0;in;i+) if (ai=num) flag=i;break; if (flag) for(i=0;in;i+) if (i!=flag) printf(%d ,ai); else printf(Cannot find it!);12.1main()int j,k,a12,*p; for(p=a;pa+12;p+) scanf(%d,p); for(p=a,j=1;j=12;j+) printf(%d ,*(p+j-1); if (j%4=0) printf(n); 12.2struct listint i,weight;a10,b;main()int i,j,k; for(i=0;i10;i+) scanf(%d,&ai.i); ai.weight=i+1; for(i=0;i9;i+) for(j=0;j10;j+) if(ai.iaj.i) b=ai;ai=aj;aj=b; printf(DataOriginal); for(i=0;i9;i+) printf(%d %dn,ai.i,ai.weight);12.3int strcomp(char *s,char *t)while(*t+=*s+) if (*s*t) return(-1); else if(*s=*t) return(0); else return(1);main()char ch480; int i,j,k; char min80; for (i=0;i4;i+) gets(chi); for (i=0;istrlen(ch0);i+) mini=ch0i; for (i=1;i0) for (j=0;j999|data=1&d%sn,c,b,a,d,monthd.ch); else printf(*n); 13.3void fun(char s80,char t80)char c80; if (strcmp(s,t)0) strcpy(c,s); strcpy(s,t); strcpy(t,c); main()char ch580; int i,j,k,l; for(i=0;i5;i+) gets(chi); for(i=0;i4;i+) for(j=i+1;j5;j+) fun(chi,chj); for(i=0;i5;i+) puts(chi);13.4struct listint data,weight,ll;a100,k;main()int n,i,j,len,pp; printf(Please input n: ); scanf(%d,&n); for (i=0;in;i+) scanf(%d,&ai.data); ai.weight=i+1; ai.ll=0; for (i=0;in-1;i+) for (j=i+1;jaj.data) k=ai;ai=aj;aj=k; pp=a0.data;len=1;a0.ll=1; for (i=0;in;i+) if (ai.data!=pp) len+;ai.ll=len;pp=ai.data; else ai.ll=len; for(i=0;in-1;i+) for(j=i+1;jaj.weight) k=ai;ai=aj;aj=k; for(i=0;in;i+) printf(%d ,ai.ll); printf(n);13.5#include #include #include int main() char ho128; char ch128; int i; for(i=1993;i=1;i-) itoa(i,ho,2); strcpy(ch,ho); strrev(ho); if(!strcmp(ch,ho) printf(%dn,i);break; return 0;14.1struct listlong xh,zcj; char xm80; int cj3;data5;void input()int i,j,k; for(i=0;i5;i+) scanf(%d,&datai.xh); scanf(%s,&datai.xm); datai.zcj=0; for(j=0;j3;j+) scanf(%d,&datai.cjj); datai.zcj=datai.zcj+datai.cjj; double averge()int i,k,l; double j; j=0; for (i=0;i5;i+) j=j+datai.zcj; j=j/5; return(j);void max()int i,j,max; max=data0.zcj;j=0; for(i=1;imax) max=datai.zcj;j=i; printf(The Best student is:n); printf(%ld%s%d%d%d%.2fn,dataj.xh,dataj.xm,dataj.cj0,dataj.cj1,dataj.cj2,dataj.zcj/3.0);main() input(); printf(The average is=%.2lfn,averge(); max(
温馨提示
- 1. 本站所有资源如无特殊说明,都需要本地电脑安装OFFICE2007和PDF阅读器。图纸软件为CAD,CAXA,PROE,UG,SolidWorks等.压缩文件请下载最新的WinRAR软件解压。
- 2. 本站的文档不包含任何第三方提供的附件图纸等,如果需要附件,请联系上传者。文件的所有权益归上传用户所有。
- 3. 本站RAR压缩包中若带图纸,网页内容里面会有图纸预览,若没有图纸预览就没有图纸。
- 4. 未经权益所有人同意不得将文件中的内容挪作商业或盈利用途。
- 5. 人人文库网仅提供信息存储空间,仅对用户上传内容的表现方式做保护处理,对用户上传分享的文档内容本身不做任何修改或编辑,并不能对任何下载内容负责。
- 6. 下载文件中如有侵权或不适当内容,请与我们联系,我们立即纠正。
- 7. 本站不保证下载资源的准确性、安全性和完整性, 同时也不承担用户因使用这些下载资源对自己和他人造成任何形式的伤害或损失。
最新文档
- 咨询直播方案怎么写好
- 江门企业拓展活动方案策划
- 保险咨询方案收费原因
- 还款咨询方案怎么写
- 节日活动策划方案案例分析
- 脑部障碍康复咨询方案
- 苏州职业危机咨询方案
- 朔州液压顶管施工方案
- 幼儿园舞蹈排练比赛合同范文8篇
- 施工现场设备管理措施专项施工方案
- 场景速写课件
- GPS的课件教学课件
- 2026年高考作文备考之抗日战争胜利80周年(九三阅兵)主题素材积累与运用
- 肺栓塞考试题及答案
- 2025年运动员:体育与健康知识试题及答案
- 综合实践 探索年月日的秘密(教案)北师大版数学三年级上册
- 2025年医师三基考试试题及答案(上半年)
- 2025年调酒师职业资格考试模拟试题集锦及答案
- 基孔肯雅热主题班会课件
- 2025年北京市公务员考试行测真题及答案详解(全优)
- 锁骨下盗血综合征伴锁骨下动脉闭塞的护理查房
评论
0/150
提交评论