杭电 human number1058

如果N为humble number ，则必满足N=pow(2,i)*pow(3，j)*pow(5,k)*pow(7,l);

i,j,k,l逐渐递增，依次枚举出！

 

#include<stdio.h>
int main()
{ 
 int m,n,i,j,k,l,min,x1,x2,x3,x4,a[5843];
 i=j=k=l=1;
 a[0]=1;
 for(m=1;m<=5842;m++)
 {
  x1=a[i-1]*2;
  x2=a[j-1]*3;
  x3=a[k-1]*5;
  x4=a[l-1]*7;
  min=x1;
  if(min>x2) min=x2;
  if(min>x3) min=x3;
  if(min>x4) min=x4;
  a[m]=min;
  if(x1==min) i++;
  if(x2==min) j++;
  if(x3==min) k++;
  if(x4==min) l++;
  
 }
 while(scanf("%d",&n)&&n)
 {
  if(n==1&&n0!=11)
        printf("The %dst humble number is %d.\n",n,a[n-1]);
  else if(n==2&&n0!=12) 

       printf("The %dnd humble number is %d.\n",n,a[n-1]);
  else if(n==3&&n0!=13) 
        printf("The %drd humble number is %d.\n",n,a[n-1]);
  else
       printf("The %dth humble number is %d.\n",n,a[n-1]);
  
 }
 return 0;
}