三级网络技术上机C语言题库43-51（Third-level network technology, computer C, 43-51）.docVIP

下载本文档

4
0
约1.67万字
约 31页
2017-07-21 发布于河南
举报
版权申诉

三级网络技术上机C语言题库43-51（Third-level network technology, computer C, 43-51）.doc

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

三级网络技术上机C语言题库43-51（Third-level network technology, computer C, 43-51）

三级网络技术上机C语言题库43-51（Third-level network technology, computer C, 43-51） Other data processing 43 the topic Please write the title 】【 function countvalue (), its function is to: within o n (not including n) at the same time can be divided exactly by 3 and 7 of the square root of the sum of all natural Numbers S, and as a function value is returned, the final results S output to file out. Dat. For example, if n is 1000, the function value should be: s = 153.909064. Note: some source programs are given. Do not change main function main () and input output data function progReadWrite (). 【 reference 】 # include conio. H H # include math.h # include Windows. H # include stdio, h Double countvalue (int n) { Double x, y = 0.0; Int I; For (I = 1; I n; i++) If (I % 3 = = 0 I % 7 = = 0), y + = I; Y = SQRT ((double) x, y); / / SQRT () to take the square root function / / Return the xy; } The main () { System ( CLS ); Printf ( square root of the sum of natural Numbers = % f \ n , countvalue (1000)); ProgWrite (); } ProgWrite () { The FILE * wf. Int I; Float s; Wf = fopen ( OUT. DAT , w); S = countvalue (1000); Fprintf (wf, % f \ n, s); The fclose (wf); } Question 44 Please write the title 】【 function void countValue (int * a, int * n), its function is to: find out within 1 to 1000 can be divided exactly by 7 or 11 but cannot be divided exactly by 7 and 11 all integers, coexist in a of the array, by n returns the number of the number. Note: some source programs are given. Dont change the main function main () and writeDAT (). 【 reference 】 # include conio. H # include stdio, h # include Windows. H A void countValue (int * and an int * n) { Int I; N = 0; For (I = 1; I = 1000; i++) If ((I % 7 = = 0 I % 11! = 0) | | (I % 7! = 0 I % 11 = = 0)) A. a [(n) + +] = I; } The main () { Int aa [1000], n, k; System ( CLS ); Aa, countValue (n); For (k = 0; k n; k++) If ((k + 1) % 10 = = 0) {printf ( % 5 d, aa [k]); Printf ( \ n ); } The else printf ( % 5 d, aa [k]); Wri