OpenJudge1249 Humble Numbers

题目：http://noi.openjudge.cn/ch0405/1249/
分析：一开始这题写的优先队列，后来发现了更好的做法——DP.经典的取最小+去重DP
代码：

#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
const int Tmax=5842,pri[5]={0,2,3,5,7};
int n,p[5];
long long int f[Tmax+5];
void init()
{
    int i,j;
    p[1]=p[2]=p[3]=p[4]=1;
    memset(f,0x3f,sizeof(f));
    f[1]=1;
    for(i=2;i<=Tmax;i++)
    {
        for(j=1;j<=4;j++)
          f[i]=min(f[i],f[p[j]]*pri[j]);
        for(j=1;j<=4;j++)
          if(f[i]==f[p[j]]*pri[j]) p[j]++;
    }
    return;
}
int main()
{
    init();
    while(scanf("%d",&n)==1&&n!=0)
    {
        if(n%10==1&&n%100!=11)
            printf("The %dst humble number is %d.\n",n,f[n]);
        else if(n%10==2&&n%100!=12)
            printf("The %dnd humble number is %d.\n",n,f[n]);
        else if(n%10==3&&n%100!=13)
            printf("The %drd humble number is %d.\n",n,f[n]);
        else
            printf("The %dth humble number is %d.\n",n,f[n]);
    }
    return 0;
}