【light-oj】-1109 - False Ordering（数学）

1109 - False Ordering

PDF (English)

Statistics

Forum

Time Limit: 1 second(s)

Memory Limit: 32 MB

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

读懂题意就很好做了！

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
#define CLR(a,b) memset(a,b,sizeof(a))
#define INF 0x3f3f3f3f
#define LL long long
struct node
{
	int n,num;
}a[1010];
bool cmp(node x,node y)
{	
	if(x.num==y.num)
		return x.n>y.n;
	return x.num<y.num;
}
int main()
{
	int u,ca=1;
	scanf("%d",&u);
	for(int i=1;i<=1000;i++)	
		a[i].n=i;
	for(int i=1;i<=1000;i++)
	{
		for(int j=1;j<=i;j++)
		{
			if(a[i].n%j==0)
				a[i].num++;
		}
	}
	sort(a+1,a+1001,cmp);
	while(u--)
	{
		int n;
		scanf("%d",&n);
		printf("Case %d: %d\n",ca++,a[n].n);
	}
	return 0;
}