False Ordering

http://acm.hust.edu.cn:8080/judge/contest/view.action?cid=8086#problem/A

A - False Ordering

Description

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

5

1

2

3

4

1000

Sample Output

Case 1: 1

Case 2: 997

Case 3: 991

Case 4: 983

Case 5: 840

#include <iostream>
#include <algorithm>
using namespace std;

struct pp 
{
    int num,count;
};
pp a[1002];

bool cmp(const pp &x,const pp &y)
{
    if (x.count<y.count)
    {
        return true;
    }
    else
        if (x.count>y.count) return
             false;
    else
    {
        if (x.num>y.num)
    {
        return true;
    }
        else return false;
    }
}
int main()
{
    int n,i,j;
    for (i=1;i<1001;i++)
    {
        a[i].num=i;
        for (j=1;j<=i;j++)
        {
            if (i%j==0)
            {
                a[i].count++;                
            }
        }    
    }
    //cout<<a[1000].count<<endl;
    sort(a,a+1001,cmp);
    cin>>n;
    for(i=1;i<=n;i++)
    {
        int m;
        cin>>m;
        cout<<"Case "<<i<<": "<<a[m].num<<endl;
    }
    return 0;
}