HDU 1058 Humble Numbers（dp）

标签：des   style   http   io   os   ar   for   sp   div   

1
2
3
4
11
12
13
21
22
23
100
1000
5842
0

The 1st humble number is 1.
The 2nd humble number is 2.
The 3rd humble number is 3.
The 4th humble number is 4.
The 11th humble number is 12.
The 12th humble number is 14.
The 13th humble number is 15.
The 21st humble number is 28.
The 22nd humble number is 30.
The 23rd humble number is 32.
The 100th humble number is 450.
The 1000th humble number is 385875.
The 5842nd humble number is 2000000000.

#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdio>
#include<queue>
#include<stack>
using namespace std;

#define N 5843

int a[N],c[4];

int main()
{
	int i,j;
	int x,y,z,w;
	x=y=w=z=1;
	a[0]=1;
	int temp;
	for(i=1;i<N;i++)
	{
		 c[0]=a[x-1]*2;
		 c[1]=a[y-1]*3;
		 c[2]=a[z-1]*5;
		 c[3]=a[w-1]*7;

		 temp=c[0];

		 for(j=1;j<4;j++)
			if(c[j]<temp)
			  temp=c[j];

		 if(c[0]==temp)
			x++;

		if(c[1]==temp)
			y++;

		if(c[2]==temp)
			z++;

		if(c[3]==temp)
			w++;

		a[i]=temp;
	}

		int n;
		while(~scanf("%d",&n),n)
		{
			if(n%10==1&&n%100!=11)
				printf("The %dst humble number is %d.\n",n,a[n-1]);
			else
				if(n%10==2&&n%100!=12)
				printf("The %dnd humble number is %d.\n",n,a[n-1]);
			else
				if(n%10==3&&n%100!=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;
}

HDU 1058 Humble Numbers（dp）

标签：des   style   http   io   os   ar   for   sp   div   

原文地址：http://blog.csdn.net/u014737310/article/details/40083129