#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;
}
ZOJ 3286 Very Simple Counting(打表)
最新推荐文章于 2019-04-14 20:56:41 发布