Humble Numbers（dp）

从4个数中分别找*2,*3,*5,*7最小就为状态转移方程，自己倒是真想不到这个代码的实现思路，以及没想11，12，13居然th结尾（一直wa），借鉴了网上大佬思路

#include<iostream>
#include<cstring>
using namespace std;
const int N =  5900;
int dp[N];
int main()
{
    dp[1] = 1;
    int a,b,c,d;
    a = b = c = d = 1;
    for(int i=2;i<=5842;i++)
    {
        dp[i] = min(dp[a]*2,min(dp[b]*3,min(dp[c]*5,dp[d]*7)));
        if(dp[i]==2*dp[a]) a++;
        if(dp[i]==3*dp[b]) b++;
        if(dp[i]==5*dp[c]) c++;
        if(dp[i]==7*dp[d]) d++; 
    }
    int n;
    while(cin>>n&&n)
    {
        if(n%10==1&&n%100!=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]);
    }
}