HDU1058-Humble Numbers

喔，一个很有想法的解法，优先队列也可以，但是这个的思维性深一点。

#include<stdio.h>
#include<algorithm>
using namespace std;
#define ll long long
int f[6000];
int main()
{
    f[1]=1;
    int a=1,b=1,c=1,d=1;
    int t1,t2,t3,t4;
    for(int i=2;i<=5842;i++)
    {
        t1=f[a]*2;
        t2=f[b]*3;
        t3=f[c]*5;
        t4=f[d]*7;

        int t=min(min(t1,t2),min(t3,t4));
        f[i]=t;
        if(t==t1) a++;
        if(t==t2) b++;
        if(t==t3) c++;
        if(t==t4) d++;
    }
    int n;
    while(scanf("%d",&n)&&n)
    {
       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]);

    }
}