摘要:
题意:给定m和n,求出最大的k,使得m^k能整除n的阶乘。 思路:各自分解质因数,然后对比下就能找出k值。 # include # include # include using namespace std;const int MAXN = 10000;int a[MAXN+1]={0}, ... 阅读全文
摘要:
序列变换 Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1348 Accepted Submission(s): 593 ... 阅读全文
摘要:
Zjnu Stadium Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3256 Accepted Submission(... 阅读全文
摘要:
WHUgirls Time Limit: 3000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 2810 Accepted Submission(s)... 阅读全文