CY_

  博客园  :: 首页  :: 新随笔  :: 联系 :: 订阅 订阅  :: 管理

2014年3月28日

摘要: 继续数论。。Problem DescriptionWhereIsHeroFrom:Zty,what are you doing ?Zty:Iwant to calculate N!......WhereIsHeroFrom:Soeasy! How big N is ?Zty:140时,输出全部为 0。。。***********************************************************/#include#includeusing namespace std;int num[42];void cal(){ num[0] = 1,num[1] = 1; for( 阅读全文
posted @ 2014-03-28 21:22 CY_ 阅读(140) 评论(0) 推荐(0) 编辑

摘要: Problem DescriptionWritea program to read in a list of integers and determine whether or not eachnumber is prime. A number, n, is prime if its only divisors are 1 and n. Forthis problem, the numbers 1 and 2 are not considered primes.InputEachinput line contains a single integer. The list of integers 阅读全文
posted @ 2014-03-28 19:29 CY_ 阅读(276) 评论(0) 推荐(0) 编辑