Let f(n) be the number of factors of integer n.
Your task is to count the number of i(1 <= i < n) that makes f(i) = f(n).
Input
One n per line (1 < n <= 1000000).
There are 10000 lines at most.
Output
For each n, output counting result in one line.
Sample Input
4
5
Sample Output
0
2
Hint
f(1) = 1, f(2) = f(3) = f(5) = 2, f(4) = 3.
直接枚举肯定超时,用f[n]保存n的因子个数,s[n]保存比n小且因子数相同的数个数
#include <stdio.h> #define MAXN 1000001 int f[MAXN]={0}; int s[MAXN]={0}; int c[MAXN]={0}; int main() { //先求出每个数的因子数 for(int i=1; i<MAXN; i++){ for(int j=1; i*j<MAXN; j++){ f[i*j]++; } } //统计比i小且因子数相同的数 for(int i=1; i<MAXN; i++){ s[i]=c[f[i]]; c[f[i]]++; } int n; while( scanf("%d",&n)!=EOF ){ printf("%d\n",s[n]); } return 0; }