1045.cpp

自己在nankai上面做的一部分题

#include <stdio.h>

#define MAX 5843

double arr[MAX+1];

int main()
{
int i,j,k,n;
int list[4]={2,3,5,7};
double min,m;
arr[0]=0;
arr[1]=1;

for(i=2;i<=MAX;i++)
{
min=0;
for(j=i-1;arr[j]*list[3]>arr[i-1];j--)
{
for(k=3;k>=0;k--)
{
m=list[k]*arr[j];
if(m<=arr[i-1])
break;
else if(min==0||min>m)
min=m;
}
}
arr[i]=min;
}

while (scanf("%d",&n)!=EOF&&n)
{
	if (n%100==11||n%100==12||n%100==13)
	{printf("The %dth humble number is %.0lf.\n",n,arr[n]);continue;}
	if (n%10==1)
	{printf("The %dst humble number is %.0lf.\n",n,arr[n]);continue;}
	if (n%10==2)
	{printf("The %dnd humble number is %.0lf.\n",n,arr[n]);continue;}
	if (n%10==3)
	{printf("The %drd humble number is %.0lf.\n",n,arr[n]);continue;}
	printf("The %dth humble number is %.0lf.\n",n,arr[n]);
}
return 0;
}