2013年10月20日
HDU-1406 完数
摘要： http://acm.hdu.edu.cn/showproblem.php?pid=1406 完数Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 15365Accepted Submission(s): 5592 Problem Description完数的定义：如果一个大于1的正整数的所有因子之和等于它的本身，则称这个数是完数，比如6，28都是完数：6=1+2+3；28=1+2+4+7+14。本题的任务是判断两个正整数之间完数的个数。Inp 阅读全文
posted @ 2013-10-20 15:51 疯狂的癫子 阅读(149) 评论(0) 推荐(0) 编辑
HDU-1395 2^x mod n = 1
摘要： http://acm.hdu.edu.cn/showproblem.php?pid=1395怎样取余是关键。。 2^x mod n = 1Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 9534Accepted Submission(s): 2932 Problem DescriptionGive a number n, find the minimum x(x>0) that satisfies 2^x mod n = 1.Input 阅读全文
posted @ 2013-10-20 15:32 疯狂的癫子 阅读(212) 评论(0) 推荐(0) 编辑
HDU-1391 Number Steps
摘要： http://acm.hdu.edu.cn/showproblem.php?pid=1391Number StepsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 3280Accepted Submission(s): 2030 Problem DescriptionStarting from point (0,0) on a plane, we have written all non-negative integers 0, 1, 2,. 阅读全文
posted @ 2013-10-20 14:16 疯狂的癫子 阅读(213) 评论(0) 推荐(0) 编辑