#include<iostream>
#include<algorithm>
int num[5850];
using namespace std;
int main()
{ int n,p2,p3,p5,p7;
p2=p3=p5=p7=1;
int m=1;
num[1]=1;
while(m<=5842)
{
num[++m]=min(min(2*num[p2],3*num[p3]),min(5*num[p5],7*num[p7]));
if(num[m]==2*num[p2])p2++;
if(num[m]==3*num[p3])p3++;
if(num[m]==5*num[p5])p5++;
if(num[m]==7*num[p7])p7++;
}
while(scanf("%d",&n),n)
{
printf("The %d",n);
m=n/10%10;
if(n%10==1&&m!=1)
printf("st ");
else if(n%10==2&&m!=1)
printf("nd ");
else if(n%10==3&&m!=1)
printf("rd ");
else
printf("th ");
printf("humble number is %d.\n",num[n]);
}
return 0;
}
Humble Numbers --动态规划之丑数
最新推荐文章于 2022-09-12 17:12:45 发布