Lightoj1109——False Ordering（简单数学）

We define b is a Divisor of a number a if a is divisible by b. So, the divisors of 12 are 1, 2, 3, 4, 6, 12. So, 12 has 6 divisors.

Now you have to order all the integers from 1 to 1000. x will come before y if

1)                  number of divisors of x is less than number of divisors of y

2)                  number of divisors of x is equal to number of divisors of y and x > y.

Input

Input starts with an integer T (≤ 1005), denoting the number of test cases.

Each case contains an integer n (1 ≤ n ≤ 1000).

Output

For each case, print the case number and the n^th number after ordering.

Sample Input	Output for Sample Input
5 1 2 3 4 1000	Case 1: 1 Case 2: 997 Case 3: 991 Case 4: 983 Case 5: 840

找1-1000的数的因子个数，然后按照因子个数从大到小排序，如果因子个数相等，按照数最大的排在前面。还好数据规模不大，二重循环找因子个数也能过。

#include<stdio.h>
#include<algorithm>
#include<string.h>
#include<iostream>
#include<cmath>
#define MAXN 10000
using namespace std;
struct Number
{
    int num,cnt;
};
Number numb[1000];
void init()
{
    numb[0].num=1;
    numb[0].cnt=1;
    int i,j;
    for(i=2;i<=1000;++i)
    {
        numb[i-1].num=i;
        numb[i-1].cnt=0;
        for(j=1;j<=i;++j)
        {
            if(i%j==0)
                numb[i-1].cnt++;
        }
    }
}
bool cmp(Number a,Number b)
{
    if(a.cnt==b.cnt)
        return a.num>b.num;
    else
        return a.cnt<b.cnt;
}
int main()
{
    init();
    sort(numb,numb+1000,cmp);
    int t,cnt=1,i,j,n;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&n);
        printf("Case %d: %d\n",cnt++,numb[n-1].num);
    }
    return 0;
}