hdu1058humble numbers

题目：hdu1058

 

方法：

①从5开始，判断每一个数是否是humble numbers,一直判断到2000000000，显然这样会超时，这也是没办法的办法，就是把满足条件的都输出来，然后把它们存到一个数组里面，这样虽然字节数很多，过还是能够过的。

int judge(long n) { while(n%2==0)n/=2; while(n%3==0)n/=3; while(n%5==0)n/=5; while(n%7==0)n/=7; if(n==1)return 1; return 0; }

②找规律:humble[t]=min(2*humble[i],3*humble[j],5*humble[k],7*humble[l]);

 

代码：

 

#include <iostream> using namespace std; long humble[5843]={0,1}; void solve() { int i=1,j=1,k=1,l=1,t; long hum1,hum2,hum3,hum4,min; for(t=2;t<5843;t++) { hum1=2*humble[i];min=hum1; hum2=3*humble[j];if(min>hum2)min=hum2; hum3=5*humble[k];if(min>hum3)min=hum3; hum4=7*humble[l];if(min>hum4)min=hum4; humble[t]=min; if(humble[t]==hum1)i++; if(humble[t]==hum2)j++; if(humble[t]==hum3)k++; if(humble[t]==hum4)l++; } } int main() { long n; solve(); while(scanf("%d",&n)!=EOF&&n) { if(n/10%10==1)printf("The %dth humble number is %ld./n",n,humble[n]); else if(n%10==1)printf("The %dst humble number is %ld./n",n,humble[n]); else if(n%10==2)printf("The %dnd humble number is %ld./n",n,humble[n]); else if(n%10==3)printf("The %drd humble number is %ld./n",n,humble[n]); else printf("The %dth humble number is %ld./n",n,humble[n]); } return 0; }