ZOJ 3286 Very Simple Counting(打表)

#include <iostream>
#include <cstdio>
#include <memory.h>
using namespace std;
const int maxn=1000010;
int cnt[maxn],cnt2[maxn],tb[maxn],n;
void init(){
	for (int i=1;i<maxn;++i){
		for (int j=1;j*i<maxn;++j){
			cnt[i*j]++;
		}
	}
	for (int i=1;i<maxn;++i){
		tb[i]=cnt2[cnt[i]]++;
	}
}
int main(){
	init();
	while (scanf("%d",&n)==1){
		printf("%d\n",tb[n]);
	}
	return 0;
}