c语言程序设计72套题（C language program design of 72 sets of questions）.docVIP

下载本文档

5
0
约1.68万字
约 20页
2017-08-21 发布于河南
举报
版权申诉

c语言程序设计72套题（C language program design of 72 sets of questions）.doc

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

c语言程序设计72套题（C language program design of 72 sets of questions）

c语言程序设计72套题（C language program design of 72 sets of questions） The 1. series: the viewpoint of E (1) =e (2) =1, e (n) = (n-1) *e (n-1) + (n-2) *e (n-2) (n2) called the E series, each e (n (n=1,2),... Known as the e number). [130000]: (1) the maximum number of E. (16687) (2) the number of E numbers. (8) between 2. and 7 [11000] calculated 5 can be divisible by the number. Calculate (in ascending order): (1) twentieth this number. (700) (2) the first 20 and the number of such. (7350) 3. known: Viewpoint of F (0) =F (1) =F (2) =1 F (N) =F (N-1) -2F (N-2) +F (N-3) (N2) Requirements: (1) F (50) (212101) (2) F (0) +F (1 +)... +F (50) (-97262) 4. known: Viewpoint of F (0) =F (2) =1 Just F (1) =0 F (N) =F (N-1) -2F (N-2) +F (N-3) (N2) For F (0) F (200): (1) positive number. (100) (2) the number of zero. (2) 5. known: Viewpoint of F (0) =F (1) =1 Just F (2) =0 F (N) =F (N-1) -2F (N-2) +F (N-3) (N2) (1) the maximum value (598325) (2) the minimum value (-288959) 6. 36 integer quality factor is 4, which is 2, 2, 3, 3, and 12903 of the largest integer quality factor. (23) 7. calculate the following series of values: 501 Sigma -- N=1 2N-1 Accurate to sixth decimal places. (2.937775) 8. for [100999] can be divisible by the number of the number 21. (43) 9. for less than [2478]: (1) the largest and smallest prime number. (4673) (2) the prime number. (91) (3) all prime numbers and. (19580) 10. known: N Sigma Y= (ai-bi) ^2 I=1 The viewpoint of I (I is odd) Ai= Scott I/2 (I even) Chrysene i^2 (I is odd) Bi= Scott I^3 (I even) (1) if N=10, Y. (1304735) (2) if N=15, Y. (1.184172E+07) 11. and 716539: (1) a number of quality factor. (3) (2) the minimum quality factor. (83) (3) the maximum quality factor. (97) 12. satisfaction: Chrysene A*B=716699 A+B minimum Two conditions: (1) A (563) (2) B (1273) Between 13. and : (1) the smallest prime number. (1009) (2) the largest prime number. (1999) 14. if the two prime difference is 2, then the two prime number of twins. For [2300]: (1) t