中国石油大学第六章计算机作业（China University of Petroleum sixth chapter computer operation）.doc

下载文档 降价啦

15
0
约 26页
2017-07-25 发布于河南
举报
版权申诉
保障服务

中国石油大学第六章计算机作业（China University of Petroleum sixth chapter computer operation）.doc

1、本文档共26页，可阅读全部内容。
2、有哪些信誉好的足球投注网站（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。
3、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。

中国石油大学第六章计算机作业（China University of Petroleum sixth chapter computer operation）

中国石油大学第六章计算机作业（China University of Petroleum sixth chapter computer operation） [research innovation] 6.1 who can qualify? TV station super student talent competition, because the number of entries is too much, so we should first group preliminaries. According to regulations, every 10 students for a qualifying group, judges play score (0~100 score), the first group to enter the next round; if there are students in the same score are the first, you can also enter the next round. Input: The final score of a team of 10 is given sequentially (int). Output: The serial number (0~9) of students who can qualify. #include stdio.h Void, main () { Int, s[10], a, i; A=0; For (i=0; i=9; i++) {scanf (%d, s[i]); If (s[i]a) a=s[i]; } For (i=0; i=9; i++) If (a==s[i]) printf (%d\n, I); } 6.2 the number of statistical primes Find 2 to m (including m, m=1000) all prime numbers, and put them in the array a. Input: positive integer m Output: all primes and numbers from small to large (when the prime output is controlled by%4d) Such as: Input: 10 Output: 2357 Four #include stdio.h Void, main () { Int, a, I, B, c; C=0; Scanf (%d, a); For (i=2; ia; i++) { For (b=2; bi; b++) If (i%b==0) break; If (b==i) { Printf (%4d, I); C++; } } Printf (\n); Printf (%d\n, C); } 6.3 bubble sort The basic concept of bubble sort (BubbleSort) is to compare two adjacent numbers in turn, put the decimal in front, and put the big number behind. That is, in the first row: first compare the first and the second numbers, and then put the decimal before the big one. Then compare the second numbers and the third numbers, put the decimal before the big numbers, so continue until you compare the last two numbers, put the decimal before the big number. At the end of the first trip, the maximum number is put to the end. In second times: from the beginning of the first logarithmic comparison (because may be due to exchange, number second and number third the number first is no longer less than second, the decimal number) be