POJ  2247  Humble Numbers

做了好多遍，竟然做到一半不会了，郁闷！

#include<stdio.h>
#include<string.h>
int min(int a,int b)
{
return a>b?b:a;
}
int main()
{
int num[6000],s,i,j,k,l,n;
num[1]=1;i=j=k=l=1;
for(s=2;s<=5850;s++)
{

num[s]=min(num[i]*2,min(num[j]*3,min(num[k]*5,num[l]*7)));
if(num[s]==num[i]*2)
i++;
if(num[s]==num[j]*3)
j++;
if(num[s]==num[k]*5)
k++;
if(num[s]==num[l]*7)
l++;
}
while(scanf("%d",&n),n!=0)
{
if(n==1&&n0!=11)
printf("The %dst humble number is %d.\n",n,num
);
else if(n==2&&n0!=12)
printf("The %dnd humble number is %d.\n",n,num
);
else if(n==3&&n0!=13)
printf("The %drd humble number is %d.\n",n,num
);
else printf("The %dth humble number is %d.\n",n,num
);
}
return 0;
}