HDU 1058 Humble Numbers

题目地址：点击打开链接

思路：看的标程，看的晕晕乎乎，很多细节没搞懂，除了最后2位11,12,13是th之外,逢1就是st,2就是nd,3就是rd,其他都是th

AC代码：

#include <iostream>
#include <cstdio>

using namespace std;

int a[6000];

int min4(int a,int b,int c,int d)
{
    return min(min(a,b),min(c,d));
}

int main()
{
    int p2 = 1,p3 = 1,p5 = 1,p7 = 1,n = 1,m;
    a[1] = 1;
    while(a[n] < 2000000000)
    {
        a[++n] = min4(2*a[p2],3*a[p3],5*a[p5],7*a[p7]);
        if(a[n] == 2*a[p2])
            p2++;
        if(a[n] == 3*a[p3])//不能用else if
            p3++;
        if(a[n] == 5*a[p5])
            p5++;
        if(a[n] == 7*a[p7])
            p7++;
    }
    while(scanf("%d",&m) && m)
    {
        if(m % 10 == 1 && m % 100 != 11)
            printf("The %dst humble number is",m);
        else if(m % 10 == 2 && m % 100 != 12)
            printf("The %dnd humble number is",m);
        else if(m % 10 == 3 && m % 100 != 13)
            printf("The %drd humble number is",m);
        else
            printf("The %dth humble number is",m);
        printf(" %d.\n",a[m]);
    }
    return 0;
}