摘要: 又是一题T-TTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 895Accepted Submission(s): 385 Problem DescriptionSuppose there are the symbols M, I, and U which can be combined to produce strings of symbols called "words". We start with one word 阅读全文
posted @ 2013-08-13 22:48 code_farmer_cyk 阅读(390) 评论(0) 推荐(0) 编辑
摘要: 今天又是硕果仅存的一题o(╯□╰)otime limit per test: 0.5 sec. memory limit per test: 4096 KBFor given number N you must output amount of N-digit numbers, such, that last digits of their square is equal to 987654321.InputInput contains integer number N (110时,每增加1就多输出一个0(如:N=11,输出720)。 1 #include 2 #include 3 #incl 阅读全文
posted @ 2013-08-10 21:13 code_farmer_cyk 阅读(312) 评论(0) 推荐(0) 编辑
摘要: 第一篇结题报告,献给我让我今天不用吃蛋的水题:-DTime Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluIntroduction to the problem Your job is, given a positive number N, determine if it is a multiple of eleven.Description of the input The input is a file such that each line contains a positive number. A line c 阅读全文
posted @ 2013-08-08 21:58 code_farmer_cyk 阅读(346) 评论(0) 推荐(0) 编辑