摘要: Become A Hero Time Limit: 15000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 210 Accepted Submission(s): 57 Pro 阅读全文
posted @ 2016-05-26 18:39 樱花庄的龙之介大人 阅读(222) 评论(0) 推荐(0)
摘要: The Euler function Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5235 Accepted Submission(s): 2 阅读全文
posted @ 2016-05-26 17:52 樱花庄的龙之介大人 阅读(271) 评论(0) 推荐(0)
摘要: 2^x mod n = 1 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 15810 Accepted Submission(s): 4914 阅读全文
posted @ 2016-05-26 17:27 樱花庄的龙之介大人 阅读(484) 评论(0) 推荐(1)
摘要: Multiply game Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2211 Accepted Submission(s): 794 Pr 阅读全文
posted @ 2016-05-26 15:12 樱花庄的龙之介大人 阅读(287) 评论(0) 推荐(0)
摘要: f(n) Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 457 Accepted Submission(s): 279 Problem Desc 阅读全文
posted @ 2016-05-26 10:33 樱花庄的龙之介大人 阅读(318) 评论(0) 推荐(0)
摘要: I won't tell you this is about number theory Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 458 阅读全文
posted @ 2016-05-26 10:11 樱花庄的龙之介大人 阅读(303) 评论(0) 推荐(0)
摘要: 转自:http://blog.csdn.net/pi9nc/article/details/9823615 文中 (a,b...)应该是指 gcd(a,b...) 定理一: 定理二:设a>1,m,n>0,则 HDU2685就用到上述定理。 定理三:设a>b,gcd(a,b)=1,则 定理四:设,那么 阅读全文
posted @ 2016-05-26 10:03 樱花庄的龙之介大人 阅读(752) 评论(0) 推荐(0)