摘要: ExponentiationTime Limit: 1000/500 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5265Accepted Submission(s): 1430Problem DescriptionProblems involving the computation of exact values of very large magnitude and precision are common. For example, the computation of the 阅读全文
posted @ 2013-05-10 11:35 翼展zjz 阅读(222) 评论(0) 推荐(0) 编辑
摘要: Integer InquiryTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8767Accepted Submission(s): 2227Problem DescriptionOne of the first users of BIT's new supercomputer was Chip Diller. He extended his exploration of powers of 3 to go from 0 to 333 阅读全文
posted @ 2013-05-09 17:16 翼展zjz 阅读(204) 评论(0) 推荐(0) 编辑
摘要: 回文数猜想Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3022Accepted Submission(s): 1825Problem Description一个正整数,如果从左向右读(称之为正序数)和从右向左读(称之为倒序数)是一样的,这样的数就叫回文数。任取一个正整数,如果不是回文数,将该数与他的倒序数相加,若其和不是回文数,则重复上述步骤,一直到获得回文数为止。例如:68变成154(68+86),再变成605(154+451),最后变成 阅读全文
posted @ 2013-05-08 15:26 翼展zjz 阅读(343) 评论(0) 推荐(0) 编辑
摘要: 验证角谷猜想Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4348Accepted Submission(s): 2232Problem Description数论中有许多猜想尚未解决,其中有一个被称为“角谷猜想”的问题,该问题在五、六十年代的美国多个著名高校中曾风行一时,这个问题是这样描述的:任何一个大于一的自然数,如果是奇数,则乘以三再加一;如果是偶数,则除以二;得出的结果继续按照前面的规则进行运算,最后必定得到一。现在请你编写一个程序验 阅读全文
posted @ 2013-05-08 11:55 翼展zjz 阅读(258) 评论(0) 推荐(0) 编辑
摘要: 展开字符串Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 893Accepted Submission(s): 374Problem Description在纺织CAD系统开发过程中,经常会遇到纱线排列的问题。该问题的描述是这样的:常用纱线的品种一般不会超过25种,所以分别可以用小写字母表示不同的纱线,例如:abc表示三根纱线的排列;重复可以用数字和括号表示,例如:2(abc)表示abcabc;1(a)=1a表示a;2ab表示aab;如果括号前 阅读全文
posted @ 2013-05-08 08:22 翼展zjz 阅读(188) 评论(0) 推荐(0) 编辑
摘要: Reverse NumberTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3771Accepted Submission(s): 1736Problem DescriptionWelcome to 2006'4 computer college programming contest!Specially, I give my best regards to all freshmen! You are the future of HDU 阅读全文
posted @ 2013-05-04 07:46 翼展zjz 阅读(215) 评论(0) 推荐(0) 编辑
摘要: 寻找素数对Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5839Accepted Submission(s): 2882Problem Description哥德巴赫猜想大家都知道一点吧.我们现在不是想证明这个结论,而是想在程序语言内部能够表示的数集中,任意取出一个偶数,来寻找两个素数,使得其和等于该偶数.做好了这件实事,就能说明这个猜想是成立的.由于可以有不同的素数对来表示同一个偶数,所以专门要求所寻找的素数对是两个值最相近的.Input输 阅读全文
posted @ 2013-05-03 21:56 翼展zjz 阅读(118) 评论(0) 推荐(0) 编辑
摘要: 统计同成绩学生人数Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10872Accepted Submission(s): 6467Problem Description读入N名学生的成绩,将获得某一给定分数的学生人数输出。Input测试输入包含若干测试用例,每个测试用例的格式为 第1行:N 第2行:N名学生的成绩,相邻两数字用一个空格间隔。 第3行:给定分数当读到N=0时输入结束。其中N不超过1000,成绩分数为(包含)0到100之间的... 阅读全文
posted @ 2013-05-03 18:33 翼展zjz 阅读(123) 评论(0) 推荐(0) 编辑
摘要: Problem DescriptionIgnatius is doing his homework now. The teacher gives him some articles and asks him to tell how many times each letter appears.It's really easy, isn't it? So come on and AC ME.InputEach article consists of just one line, and all the letters are in lowercase. You just have 阅读全文
posted @ 2013-04-17 22:40 翼展zjz 阅读(177) 评论(0) 推荐(0) 编辑
摘要: An Easy TaskTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10926Accepted Submission(s): 6818Problem DescriptionIgnatius was born in a leap year, so he want to know when he could hold his birthday party. Can you tell him?Given a positive integers Y 阅读全文
posted @ 2013-04-17 17:49 翼展zjz 阅读(261) 评论(0) 推荐(0) 编辑