LiuXingLong

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

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:

找新朋友 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:

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

/**题目：Factorial Factors 链接：http://acm.hust.edu.cn/vjudge/contest/view.action?cid=79877#problem/F题意：输出N!的不同的素数的个数，以及素数约数的总个数；思路：找N!不同素数约数的个数，即找出1到N素数的个数，可以通过筛法处理，同时可以记录非素数对应的最大素数约束，然后

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 +