1058 丑数

如果直接一个个判断过去， 肯定time out 。

所以弄一个数组存丑数， 空间换时间。

#include<iostream>
using namespace std;
int a[5843] = {0};
inline int min_(int &a,int &b, int&c,int &d)
{
	int e,f;
	e = a<b?a:b;
	f = c<d?c:d;
	return e<f?e:f;
}
void creat_humble_number()
{
	int m2,m3,m5,m7,f2,f3,f5,f7,mark;
	f2 = f3 = f5 = f7 = 1;
	a[1] = 1;
	m2 = 2;
	m3 = 3;
	m5 = 5;
	m7 = 7;
	for(int i = 2 ; i <=5842 ; i++)
	{
		a[i] = min_(m2,m3,m5,m7);
		if(a[i] == m2)mark = 2;
		else if(a[i] == m3)mark = 3;
		else if(a[i] == m5)mark = 5;
		else mark = 7;
		switch(mark){
		case 2:
			if(m2 <= a[i-1])i--;  //因为有可能m2会等于a[i-1],所以判断一下避免重复。
			f2++;
			m2 = a[f2]*2;
			break;
		case 3:
			if(m3 <= a[i-1])i--;
			f3++;
			m3 = a[f3]*3;
			break;
		case 5:
			if(m5 <= a[i-1])i--;
			f5++;
			m5 = a[f5]*5;
			break;
		case 7:
			if(m7 <= a[i-1])i--;
			f7++;
			m7 = a[f7]*7;
			break;
		}

	}
}
int main()
{
	creat_humble_number();
	int n,tmp;
	while(scanf("%d",&n),n != 0)
	{
		printf("The %d",n);
		tmp = n%100;
		if(tmp == 11||tmp ==12||tmp ==13)printf("th ");
		else
		{
			tmp = n%10;
			switch(tmp)
			{
			case 1:
				printf("st ");
				break;
			case 2:
				printf("nd ");
				break;
			case 3:
				printf("rd ");
				break;
			default:
				printf("th ");
				break;
			}
		}
		printf("humble number is %d.\n",a[n]);

	}

	return 0;
}