hdu1058 Humble Numbers

来源：互联网发布：p2p网络借贷法律规定编辑：程序博客网时间：2024/04/30 18:21

http://acm.hdu.edu.cn/showproblem.php?pid=1058

#include<iostream>#include<stdio.h>#include<string.h>using namespace std;int n,i,j,k,t,l;int a[6000];int max(int a,int b,int c,int d){int min=a;if(b<min)min=b;if(c<min)min=c;if(d<min)min=d;if(a==min){i++;}if(b==min){j++;}if(c==min){k++;}if(d==min){t++;}return min;}int main(){a[1]=1;i=j=k=t=1;for(l=2;l<=5842;l++){a[l]=max(2*a[i],3*a[j],5*a[k],7*a[t]);//这里其实是求最小的}while(scanf("%d",&n)!=EOF){if(n==0)break;if(n%10==1&&n%100!=11)printf("The %dst humble number is %d.\n",n,a[n]);else if(n%10==2&&n%100!=12)printf("The %dnd humble number is %d.\n",n,a[n]);elseif(n%10==3&&n%100!=13)printf("The %drd humble number is %d.\n",n,a[n]);elseprintf("The %dth humble number is %d.\n",n,a[n]);}return 0;}

又是一道dp的题，还是木有找到做这种题的感觉。

思路就是不断地找出2^i 3^j 5^k 7^k相乘起来的合数，但是因为题目要求是要排序，所以每次都找到最小的

0 0