电大《C++语言程序设计》第1、2、3、4次作业及答案

上传人:1777****777 文档编号:37335097 上传时间:2021-11-02 格式:DOC 页数:25 大小:170KB
收藏 版权申诉 举报 下载
电大《C++语言程序设计》第1、2、3、4次作业及答案_第1页
第1页 / 共25页
电大《C++语言程序设计》第1、2、3、4次作业及答案_第2页
第2页 / 共25页
电大《C++语言程序设计》第1、2、3、4次作业及答案_第3页
第3页 / 共25页
资源描述:

《电大《C++语言程序设计》第1、2、3、4次作业及答案》由会员分享,可在线阅读,更多相关《电大《C++语言程序设计》第1、2、3、4次作业及答案(25页珍藏版)》请在装配图网上搜索。

1、专业好文档第一次作业一、写出下列每个程序运行后的输出结果1. #includevoid main()int x=5;switch(2*x-3)case 4:printf(%d ,x);case 7:printf(%d ,2*x+1);case 10:printf(%d ,3*x-1);break;default:printf(%s ,defaultn);printf(%sn,switch end.);2. #includevoid main()int i,s=0;for(i=1;i=6;i+)s+=i*i;printf(s=%dn,s);3. #includevoid main()int i,

2、s1=0,s2=0;for(i=0;i10;i+)if(i%2)s1+=i;else s2+=i;printf(%d %dn,s1,s2);4. #includevoid main()int n=10,y=1;while(n-)y+;y+;printf(y=%dn,y);5. #includevoid main()int f,f1,f2,i;f1=f2=1;printf(%d %d ,f1,f2);for(i=3;i=10;i+)f=f1+f2;printf(%d ,f);if(i%5=0)printf(n);f1=f2;f2=f;printf(n);6. #include#includevo

3、id main()int i,n;for(n=2;n=20;n+)int temp=(int)sqrt(n);/sqrt(n)求出n的平方根并取整for(i=2;itemp)printf(%d ,n);printf(n);7. #include#includeconst int M=20;void main()int i,c2,c3,c5;c2=c3=c5=0;for(i=1;i=M;i+)if(i%2=0)c2+;if(i%3=0)c3+;if(i%5=0)c5+;printf(%d %d %dn,c2,c3,c5);8. #include#includeconst int M=20;voi

4、d main()int i,s;for(i=1,s=0;i5的最小n值。5编写一个主函数,求满足不等式22+42+n21000的最大n值,假定分别用i和s为取偶数值和累加值的变量,并限定使用do循环编程。6编写一个主函数,计算并输出n!的值,其中n值由键盘输入。参考答案:1、答案:#includevoid fun4(char* a,int b)doif(*a=0 & *a=9)b*a-48+;while(*a+);/*void main()char * a=122333444499888;int b10=0;fun4(a,b);for(int i=0;i10;i+)printf(%d ,bi)

5、;*/2、答案:#includeconst int M=2,N=3;double Mean(double aMN, int m,int n )double v=0;for(int i=0;im;i+)for(int j=0;jn;j+)v+=aij;return v/(m*n);/*void main()double a23=1,2,3,4,5,6;printf(%lfn,Mean(a,2,3);*/3、答案:#includeint FF(int a , int n)int mul=1;if(n=1)mul*=a0;else mul=an-1*FF(a,n-1);return mul;/*vo

6、id main()int a6=1,2,3,4,5,6;printf(%dn,FF(a,6);*/4、答案:#includevoid main()double sum=0;int n=1;while(true)if(sum + 1/(double)n 5)break;elsesum += 1/(double)n;n+;printf(%d, %lfn,n,sum);5、答案:#includevoid main()int s=0,i=2;dos+=i*i;if(s+(i+2)*(i+2)=1000)break;else i+=2;while(true);printf(i=%d,s=%d,i,s);

7、6、答案:#includevoid main()int s=0,n;printf(请输入n的值:);scanf(%d,&n);for(int i=1;i=n;i+)s=s*i;printf(n=%d,s=%d,n,s);第三次作业一、写出下列每个程序运行后的输出结果1 程序代码:#include void SB(char ch) switch(ch) case A: case a:printf(WW ); break;case B: case b:printf(GG ); break;case C: case c:printf(PP ); break;default:printf(BB );

8、break;void main() char a1 = b, a2 = C, a3 = f;SB(a1); SB(a2); SB(a3); SB(A);printf(n);2 程序代码:#include #include double SD(int a, int b, char op) double x;switch(op) case +: x = a + b; break;case -: x = a - b; break;case *: x = a * b; break;case /: if(b) x = (double)a/b; else exit(1); break;default: p

9、rintf(运算符错!n); exit(1); return x;void main() int x = 20, y = 8;printf(%3.2lf , SD(x, y, -);printf(%3.2lf , SD(x, y, *);printf(%3.2lfn, SD(x + y, y, /);3 程序代码:#include void WF(int x, int y) x = x + y;y = x + y;printf(subs: x, y = %d, %dn, x, y);void main() int x = 18, y = 23;printf(main: x, y = %d, %

10、dn, x, y);WF(x, y);x = 2 * x;printf(main: x, y = %d, %dn, x, y);4 程序代码:#include #include void fun(char ss);void main() char s15 = 567891234;fun(s);printf(%sn, s);void fun(char ss) int i, n = strlen(ss);for(i = 0; i n / 2; i +) char c = ssi;ssi = ssn - 1 - i;ssn - 1 - i = c;5 程序代码:#include void Inser

11、tSort(int a, int n)int i, j, x;for(i = 1; i = 0; j -) / 为x顺序向前寻找合适的插入位置if(x aj) aj + 1 = aj;else break;aj + 1 = x;void main() int i;int a6 = 20, 15, 32, 47, 36, 28 ;InsertSort(a, 6);for(i = 0; i 6; i +) printf(%d , ai);printf(n);6 程序代码:#include void main() int a8 = 3, 5, 7, 9, 11, 13, 15, 17 ;int i,

12、 * p = a;for(i = 0; i 8; i +) printf(%5d, * p +);if(i + 1) % 4 = 0) printf(n);7 程序代码:#include int LA(int * a, int n) int i, s = 0;for(i = 0; i n; i +)s += ai;return s;void main() int a = 5, 10, 15, 20, 25, 30 ;int b = LA(a, 4);int c = LA(a + 2, 3);printf(%d %dn, b, c);8 程序代码:#include int LB(int * a,

13、 int n) int i, s = 1;for(i = 0; i n; i +) s *= * a +;return s;void main() int a = 1, 2, 3, 4, 2, 4, 5, 2 ;int b = LB(a, 4) + LB(&a3, 4);printf(b=%dn, b);二、写出下列每个函数的功能1 程序代码:int WB(int a, int n, int x) int i;for(i = 0; i n; i +)if(ai = x) return 1;return 0;2 程序代码:int WC(int a, int n, int k) int c = 0

14、, i;for(i = 0; i = k) c +;return c;3 程序代码:#include #include #include const int N = 10;int ff(int x, int y) int z;printf(%d + %d = , x, y);scanf(%d, &z);if(x + y = z) return 1; else return 0;void main() int i, a, b, c = 0;srand(time(0); / 初始化随机数序列for(i = 0; i N; i +) a = rand() % 20 + 1; / rand()函数产生

15、032767之间的一个随机数b = rand() % 20 + 1;c += ff(a, b);printf(得分:%dn, c * 10);4 * 程序代码:int fun6(int m, int n, int b)if(m b & n b) return m * n;else if(m % b = 0 & n % b = 0) return b * fun6(m / b, n / b, b);else return fun6(m, n, + b);5 程序代码:#include #include void LI(int n) int * a = malloc(n * sizeof(int)

16、;int i;for(i = 0; i = 0; i -) printf(%d , * (a + i);printf(n);free(a);6 程序代码:int LK(double a, int n) double s = 0;int i, m = 0;for(i = 0; i n; i +) s += ai;s /= n;for(i = 0; i = s) m +;return m;参考答案:一、1、答案:运行结果:GG PP BB WW 2、答案:运行结果:12.00 160.00 3.503、答案:运行结果:main: x, y = 18, 23subs: x, y = 41, 64ma

17、in: x, y = 36, 234、答案:运行结果:4321987655、运行结果:47 36 32 28 20 156、答案:运行结果:3 5 7 911 13 15 177、答案:运行结果:50 608、答案:运行结果:b=184二、1、答案:在整型数组a的前n个元素中查找值为x的元素,找到返回1,找不到返回0。2、答案:统计整型数组a的前n个元素中不小于k的元素个数并返回3、答案:程序随机产生10道20以内整数加法题,请用户回答。并统计得分, 4、答案:调用fun6(m, n, 2)求m和n的最小公倍数5、答案:读入n个整数,然后逆序输出6、答案:返回双精度数数组a的前n个元素中不小于

18、平均值的元素个数。第四次作业一、写出下列每个程序运行后的输出结果1 程序代码:#include struct Worker char name15; / 姓名int age; / 年龄float pay; / 工资;void main() struct Worker x = wanghua, 52, 2350 ;struct Worker y, * p;y = x; p = &x;printf(%s %d %6.2fn, y.name, y.age, y.pay);printf(%s %d %6.2fn, p-name, p-age + 1, p-pay + 20);2 程序代码:#inclu

19、de #include struct Worker char name15; / 姓名int age; / 年龄float pay; / 工资;void main() struct Worker x;char * t = liouting;int d = 38; float f = 493;strcpy(x.name, t);x.age = d; x.pay = f;x.age +; x.pay *= 2;printf(%s %d %6.2fn, x.name, x.age, x.pay);3 程序代码:#include struct Worker char name15; / 姓名int a

20、ge; / 年龄float pay; / 工资;int Less(struct Worker r1, struct Worker r2) if(r1.age r2.age) return 1;else return 0;void main() struct Worker a4 = abc, 25, 420 , def, 58, 638 , ghi, 49, 560 , jkl, 36, 375 ;struct Worker x = a0;int i;for(i = 1; i 4; i +)if(Less(x, ai) x = ai;printf(%s %d %6.2fn, x.name, x.

21、age, x.pay);二、写出下列每个函数的功能1 程序代码:struct Worker char name15; / 姓名int age; / 年龄float pay; / 工资;void QA(struct Worker a, int n) int i;for(i = 1; i name);p = f;while(- n) p = p-next = malloc(sizeof(struct StrNode);scanf(%s, p-name);p-next = NULL;return f;3 程序代码:struct IntNode int data; / 结点值域struct IntNo

22、de * next; / 结点指针域;struct IntNode * FindMax(struct IntNode * f)struct IntNode * p = f;if(! f) return NULL;f = f-next;while(f) if(f-data data) p = f;f = f-next;return p;4 * 程序代码:struct IntNode int data; / 结点值域struct IntNode * next; / 结点指针域;int Count(struct IntNode * f)int c = 0;while(f) c +;f = f-nex

23、t;return c;5 程序代码:struct IntNode int data; / 结点值域struct IntNode * next; / 结点指针域;struct IntNode * Input(int n)struct IntNode * f, * p;f = malloc(sizeof(struct IntNode);if(n = 0) return NULL;f-next = NULL;printf(从键盘输入%d个整数:, n);while(n -) scanf(%d, &(f-data);p = f;f = malloc(sizeof(struct IntNode);f-n

24、ext = p;return f-next;6 程序代码:#include #include #include void JA(char * fname)FILE * fout = fopen(fname, w);char a20;printf(输入若干个字符串,每个字符串长度小于20,字符串end作为结束标志n);while(1) scanf(%s, a);if(strcmp(a, end) = 0) break;fputs(a, fout);fputc(n, fout);fclose(fout);void main()char * p = d:xxkxuxk1.txt;JA(p);参考答案

25、:一、1、答案:运行结果:wanghua 52 2350.00wanghua 53 2370.002、答案:运行结果:liouting 39 986.003、答案:运行结果:def 58 638.00二、1、答案:从标准输入设备读入n-1个人员的信息,依次存到结构数组的a1到an-1元素中2、答案:创建具有n个struct StrNode结点的单向链表并返回其表头结点地址,n为0时返回NULL。3、答案:函数功能:查找单向链表中结点值域最大的结点,并返回其地址。如链表为空则返回NULL4、答案:函数功能:统计并返回单向链表结点个数5、答案:函数功能:从表尾结点开始,逆序创建具有n个struct

26、 IntNode结点的单向链表并返回其表头结点地址,n为0时返回NULL6、答案:函数功能:将输入的若干个字符串保存到文本文件d:xxkxuxk1.txt中,每个字符串一行。输入的单个字符串长度必须小于20,输入字符串end结束 If we dont do that it will go on and go on. We have to stop it; we need the courage to do it.His comments came hours after Fifa vice-president Jeffrey Webb - also in London for the FAs

27、celebrations - said he wanted to meet Ivory Coast international Toure to discuss his complaint.CSKA general director Roman Babaev says the matter has been exaggerated by the Ivorian and the British media.Blatter, 77, said: It has been decided by the Fifa congress that it is a nonsense for racism to

28、be dealt with with fines. You can always find money from somebody to pay them.It is a nonsense to have matches played without spectators because it is against the spirit of football and against the visiting team. It is all nonsense.We can do something better to fight racism and discrimination.This i

29、s one of the villains we have today in our game. But it is only with harsh sanctions that racism and discrimination can be washed out of football.The (lack of) air up there Watch mCayman Islands-based Webb, the head of Fifas anti-racism taskforce, is in London for the Football Associations 150th ann

30、iversary celebrations and will attend Citys Premier League match at Chelsea on Sunday.I am going to be at the match tomorrow and I have asked to meet Yaya Toure, he told BBC Sport.For me its about how he felt and I would like to speak to him first to find out what his experience was.Uefa hasopened d

31、isciplinary proceedings against CSKAfor the racist behaviour of their fans duringCitys 2-1 win.Michel Platini, president of European footballs governing body, has also ordered an immediate investigation into the referees actions.CSKA said they were surprised and disappointed by Toures complaint. In

32、a statement the Russian side added: We found no racist insults from fans of CSKA.Baumgartner the disappointing news: Mission aborted.The supersonic descent could happen as early as Sunda.The weather plays an important role in this mission. Starting at the ground, conditions have to be very calm - wi

33、nds less than 2 mph, with no precipitation or humidity and limited cloud cover. The balloon, with capsule attached, will move through the lower level of the atmosphere (the troposphere) where our day-to-day weather lives. It will climb higher than the tip of Mount Everest (5.5 miles/8.85 kilometers)

34、, drifting even higher than the cruising altitude of commercial airliners (5.6 miles/9.17 kilometers) and into the stratosphere. As he crosses the boundary layer (called the tropopause),e can expect a lot of turbulence.The balloon will slowly drift to the edge of space at 120,000 feet ( Then, I woul

35、d assume, he will slowly step out onto something resembling an Olympic diving platform.Below, the Earth becomes the concrete bottom of a swimming pool that he wants to land on, but not too hard. Still, hell be traveling fast, so despite the distance, it will not be like diving into the deep end of a

36、 pool. It will be like he is diving into the shallow end.Skydiver preps for the big jumpWhen he jumps, he is expected to reach the speed of sound - 690 mph (1,110 kph) - in less than 40 seconds. Like hitting the top of the water, he will begin to slow as he approaches the more dense air closer to Ea

37、rth. But this will not be enough to stop him completely.If he goes too fast or spins out of control, he has a stabilization parachute that can be deployed to slow him down. His team hopes its not needed. Instead, he plans to deploy his 270-square-foot (25-square-meter) main chute at an altitude of a

38、round 5,000 feet (1,524 meters).In order to deploy this chute successfully, he will have to slow to 172 mph (277 kph). He will have a reserve parachute that will open automatically if he loses consciousness at mach speeds.Even if everything goes as planned, it wont. Baumgartner still will free fall at a speed that would cause you and me to pass out, and no parachute is guaranteed to work higher than 25,000 feet (7,620 meters).cause there25

展开阅读全文
温馨提示:
1: 本站所有资源如无特殊说明,都需要本地电脑安装OFFICE2007和PDF阅读器。图纸软件为CAD,CAXA,PROE,UG,SolidWorks等.压缩文件请下载最新的WinRAR软件解压。
2: 本站的文档不包含任何第三方提供的附件图纸等,如果需要附件,请联系上传者。文件的所有权益归上传用户所有。
3.本站RAR压缩包中若带图纸,网页内容里面会有图纸预览,若没有图纸预览就没有图纸。
4. 未经权益所有人同意不得将文件中的内容挪作商业或盈利用途。
5. 装配图网仅提供信息存储空间,仅对用户上传内容的表现方式做保护处理,对用户上传分享的文档内容本身不做任何修改或编辑,并不能对任何下载内容负责。
6. 下载文件中如有侵权或不适当内容,请与我们联系,我们立即纠正。
7. 本站不保证下载资源的准确性、安全性和完整性, 同时也不承担用户因使用这些下载资源对自己和他人造成任何形式的伤害或损失。
关于我们 - 网站声明 - 网站地图 - 资源地图 - 友情链接 - 网站客服 - 联系我们

copyright@ 2023-2025  zhuangpeitu.com 装配图网版权所有   联系电话:18123376007

备案号:ICP2024067431-1 川公网安备51140202000466号


本站为文档C2C交易模式,即用户上传的文档直接被用户下载,本站只是中间服务平台,本站所有文档下载所得的收益归上传人(含作者)所有。装配图网仅提供信息存储空间,仅对用户上传内容的表现方式做保护处理,对上载内容本身不做任何修改或编辑。若文档所含内容侵犯了您的版权或隐私,请立即通知装配图网,我们立即给予删除!