hdu1058

#include<iostream>#include<stdio.h>#include<string.h>#include<math.h>#include<algorithm>#define N 5842using namespace std;int dp[N];int a[4];int b[4];int c[4]={2,3,5,7};int main(){    int n,i,j,k;    int t,mi;    memset(a,0,sizeof(a));    memset(b,0,sizeof(b));    dp[0]=1;    for(i=1;i<N;i++)    {        for(j=0;j<4;j++)          b[j]=dp[a[j]]*c[j];        mi=b[0];        t=0;        for(j=1;j<4;j++)        {            if(mi>b[j])            {                mi=b[j];            }        }        dp[i]=mi;        for(j=0;j<4;j++)          if(b[j]==mi)            a[j]++;    }    while(scanf("%d",&n))    {        if(n==0)break;        printf("The %d",n);        if(n%10==1&&n%100!=11)          printf("st");        else          if(n%10==2&&n%100!=12)            printf("nd");          else            if(n%10==3&&n%100!=13)              printf("rd");            else              printf("th");        printf(" humble number is %d.\n",dp[n-1]);    }}