c++基础上机题库(国外英语资料).docVIP

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

c++基础上机题库(国外英语资料) First questions: Enter two positive integers m and N, write a program to find the greatest common divisor and least common multiple. Sample entry: 1525 Sample output: 575 Second questions: Output all the Narcissus numbers greater than the given number n, n by keyboard input. The so-called narcissus number refers to a 3 digit number, the number of cubic and equal to the number itself. For example, 153 is a number of daffodils, because 153=13+53+33. Sample entry: 100 Sample output: 153370371407 Third questions: A number is equal to the sum of its factors, this number is called end of a few. For example, the 6 factor is 1, 2, 3, and 6=1+2+3, so 6 is the end of a few. All the end of a few written procedures to identify less than a given number n, N input by keyboard. Sample entry: 1000 Sample output: 628496 Fourth questions: Any number greater than 1, if only divisible by 1 and the number itself, is called the prime number or the prime number. For example, 2, 3, and 5 are prime numbers. Write procedures to determine whether a number is prime number, if it is output YES, otherwise the output NO. Sample entry: 1 Sample output: NO Sample entry: 2 Sample output: YES Fifth questions: Having a fractional sequence, Calculates the first n entry of the sequence and the n is entered by the keyboard. Sample entry: 20 Sample output: 32.6603 Sixth questions: Enter a line of characters and use character 0 as the end mark to output the sum of the values of the ASCII code corresponding to the row character. Sample entry: ABCDE0 Sample output: 335 Seventh questions: Write programs to find a positive integer n, you figure the largest number, n by keyboard input. Sample entry: 1234 Sample output: 4 Eighth questions: Write procedures for m to n (including M and N, m=n), the number of prime and its average value, if no prime, then output NO, m and N by keyboard input. Sample entry: 110 Sample output: 44.25 Sample entry: 810 Sample output: NO Ninth questions: Write programs

文档评论(0)

f8r9t5c + 关注
实名认证
文档贡献者

该用户很懒,什么也没介绍

版权声明书
用户编号:8000054077000003

1亿VIP精品文档

相关文档