hdu 1058 Humble Numbers

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a[10000];
int min(int a,int b)
{
	return a>b?b:a;
}
int main ()
{
	int c2 = 1,c3 = 1,c5 = 1,c7 = 1;
	int i = 2,n;
	a[1] = 1;
	while(i<=5842)
	{
		a[i] = min(min(2*a[c2],3*a[c3]),min(5*a[c5],7*a[c7]));
		if(a[i]==2*a[c2]) c2++;
	    if(a[i]==3*a[c3]) c3++;
		if(a[i]==5*a[c5]) c5++;
		if(a[i]==7*a[c7]) c7++;
		i++;
	}
	while(scanf("%d",&n),n)
	{
		printf("The %d",n);
		if(n%10==1&&n%100!=11) printf("st");
		else if(n%10==2&&n%100!=12) printf("nd");
		else if(n%10==3&&n%100!=13) printf("rd");
		else printf("th");
		printf(" humble number is %lld.\n",a[n]);
	}
	return 0;
}

1058链接