题目链接
http://noi-test.zzstep.com/contest/0x30%E3%80%8C%E6%95%B0%E5%AD%A6%E7%9F%A5%E8%AF%86%E3%80%8D%E4%BE%8B%E9%A2%98/3101%20%E9%98%B6%E4%B9%98%E5%88%86%E8%A7%A3
分析
先预处理出不超过 n n n 的质数,再去统计对于每个质数 n ! n! n! 中有多少个。
方法是看不超过 n n n 有多少质数的乘方的倍数。
AC代码
#include <cstdio>
inline int read() {
int num = 0;
char c = getchar();
while (c < '0' || c > '9') c = getchar();
while (c >= '0' && c <= '9')
num = num * 10 + c - '0', c = getchar();
return num;
}
const int maxn = 1e6 + 5;
int vis[maxn], prime[maxn], cnt;
int main() {
int n = read();
for (int i = 2; i <= n; ++i) {
if (!vis[i]) prime[++cnt] = i;
for (int j = 1; j <= cnt && i * prime[j] <= n; ++j) {
vis[i * prime[j]] = 1;
if (i % prime[j] == 0) break;
}
}
for (int i = 1; i <= cnt; ++i) {
int ans = 0;
long long p = prime[i];
while (p <= n) ans += n / p, p *= prime[i];
printf("%d %d\n", prime[i], ans);
}
return 0;
}