hdu 1058 DP

//2563204 2010-06-30 12:34:06 Accepted 1058 62MS 256K 947 B C++
#include<iostream>
#include<stdio.h>
#include<string>
#define max_size 2000000001
using namespace std;
int main()
{
int hash[5850];
int use[4] = {1,1,1,1},min,prim[4] = {2,3,5,7};//如果hash[use[j]]与素数乘出的结果被采用 use[j]++
int i,j,n,b;
for(i = 0; i < 5844; i++)
{
hash[i] = max_size;
}
hash[1] = 1;
for(i = 2; i < 5844; i++)
{

min = max_size;
for(j = 0; j < 4; j++)
{
if(hash[use[j]]*prim[j] < min)
{
min = hash[use[j]]*prim[j];
}
}
for(j = 0; j < 4; j++)
{
if(min == hash[use[j]]*prim[j])
use[j]++;
}
hash[i] = min;
}
while(scanf("%d",&n) != EOF && n)
{
if(n%10==1&&n%100!=11)
printf("The %dst humble number is %d./n",n,hash
);
else if(n%10==2&&n%100!=12)
printf("The %dnd humble number is %d./n",n,hash
);
else if(n%10==3&&n%100!=13)
printf("The %drd humble number is %d./n",n,hash
);
else
printf("The %dth humble number is %d./n",n,hash
);
}
}