![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
质因数分解
文章平均质量分 79
mowayao
这个作者很懒,什么都没留下…
展开
-
HDU3988-Harry Potter and the Hide Story(数论-质因数分解)
Harry Potter and the Hide StoryTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2193 Accepted Submission(s): 530Problem Descripti原创 2014-07-29 23:25:06 · 766 阅读 · 1 评论 -
Uva10290 - {Sum+=i++} to Reach N
Problem H{sum+=i++} to Reach NInput: standard inputOutput: standard outputMemory Limit: 32 MB All the positive numbers can be expressed as a sum of one, two or more consecutive positive i原创 2014-07-31 17:47:18 · 861 阅读 · 0 评论 -
UVa1635 - Irrelevant Elements(质因数分解)
Young cryptoanalyst Georgie is investigating different schemes of generating random integer numbers ranging from 0 to m - 1. He thinks that standard random number generators are not good enough, s原创 2014-08-29 20:46:22 · 1621 阅读 · 0 评论