![](https://img-blog.csdnimg.cn/20201014180756724.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
数论
LiuXingLong
这个作者很懒,什么都没留下…
展开
-
GCD Again
GCD Again Time Limit : 1000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 43 Accepted Submission(s) : 19Font: Times New Roman | Verdana |Georgia Font原创 2014-03-23 10:04:49 · 767 阅读 · 0 评论 -
A/B
A/B Time Limit : 1000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 22 Accepted Submission(s) : 17Font: Times New Roman | Verdana |Georgia Font Size:原创 2014-03-23 09:55:51 · 490 阅读 · 0 评论 -
找新朋友
找新朋友 Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 79 Accepted Submission(s) : 39Font: Times New Roman | Verdana |Georgia Font Size:原创 2014-03-23 10:07:10 · 575 阅读 · 0 评论 -
Romantic
Romantic Time Limit : 2000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 36 Accepted Submission(s) : 11Font: Times New Roman | Verdana |Georgia Font S原创 2014-03-23 09:58:12 · 453 阅读 · 0 评论 -
Factorial Factors
/**题目:Factorial Factors 链接:http://acm.hust.edu.cn/vjudge/contest/view.action?cid=79877#problem/F题意:输出N!的不同的素数的个数,以及素数约数的总个数;思路:找N!不同素数约数的个数,即找出1到N素数的个数,可以通过筛法处理,同时可以记录非素数对应的最大素数约束,然后原创 2015-05-31 17:45:28 · 589 阅读 · 0 评论 -
Prime Bases
Problem DescriptionGiven any integer base b >= 2, it is well known that every positive integer n can be uniquely represented in base b. That is, we can writen = a0 + a1*b + a2*b*b + a3*b*b*b +原创 2015-06-02 18:29:26 · 586 阅读 · 0 评论