Humble Numbers HDU - 1058(打表，模拟)

原题链接

#include<iostream>
#include<algorithm>
#include<cstdio>
using namespace std;
int dp[5850] = {0, 1};
int main()
{
    int n, i;
    int x1,  x2, x3, x4;
    int dp1, dp2, dp3, dp4;
    x1 = x2 = x3 = x4 = 1;
    for(i = 2; i <= 5845; i++)
    {
        dp1 = dp[x1]*2;
        dp2 = dp[x2]*3;
        dp3 = dp[x3]*5;
        dp4 = dp[x4]*7;
        dp[i] = min(min(dp1, dp2), min(dp3, dp4));    //之所以取最小，是因为要保证它是从小到大排列
        if(dp[i] == dp1)
            x1++;
        if(dp[i] == dp2)
            x2++;
        if(dp[i] == dp3)
            x3++;
        if(dp[i] == dp4)
            x4++;
    }
    while(cin >> n && n)
    {
        if(n % 10 == 1 && n % 100 != 11)        //这一块要掌握，巧妙找到末尾是11的数
            printf("The %dst humble number is %d.\n", n, dp[n]);
        else if(n % 10 == 2 && n % 100 != 12)
            printf("The %dnd humble number is %d.\n", n, dp[n]);
        else if(n % 10 == 3 && n % 100 != 13)
            printf("The %drd humble number is %d.\n", n, dp[n]);
        else
            printf("The %dth humble number is %d.\n", n, dp[n]);
    }
    return 0;
}