lightoj 1109 struct is good

#include<stdio.h>#include<algorithm>using namespace std;struct P{int num;int count;bool operator < (const P &o) const{if(count==o.count)return num>o.num;return count<o.count;}};P n[1500];int main(){for(int i=1;i<=1000;i++){n[i].num=i;n[i].count=0;}for(int i=1;i<=1000;i++){for(int j=i;j<=1000;j++){if(j%i==0)n[j].count++;}}sort(n+1,n+1001);int cas;scanf("%d",&cas);for(int T=1;T<=cas;T++){int q;scanf("%d",&q);printf("Case %d: %d\n",T,n[q].num);}return 0;}