#include	<iostream>
#include	<cmath>
#include	<algorithm>
#define	MAX	10000

using namespace std;

void swap(int *x, int *y);

int
main(void)
{
	int		table[MAX];
	double  tmp;
	int		i, j, k, l;
	int		s;
	int		n;
	int		fir, sec;
	char	suf[3];

	s = 0;
	for (i = 0; i <= 30; ++i)
		for (j = 0; j <= 19; ++j)
			for (k = 0; k <= 13; ++k)
				for (l = 0; l <= 11; ++l)
				{
					tmp = pow((double)2, (double)i) * pow((double)3, (double)j) * pow((double)5, (double)k) * pow((double)7, (double)l);
					if (tmp <= 2000000000)
						table[s++] = tmp;
				}


	
	sort(table, table + s);
	
	cin >> n;
	while (n != 0)
	{
		fir = n % 10;
		sec = (n / 10) % 10;

		strcpy(suf, "th");
		if (sec != 1)
		{
			if (fir == 1 )
				strcpy(suf, "st");
			else if (fir == 2)
				strcpy(suf, "nd");
			else if (fir == 3)
				strcpy(suf, "rd");
		}
		cout << "The " << n << suf << " humble number is " << table[n - 1] << "." << endl;
		cin >> n;
	}

	return 0;
}

void
swap(int *x, int *y)
{
	int	tmp;

	tmp = *x;
	*x = *y;
	*y = tmp;
}

• c++能过，g++不行；应该还是程序有点问题 (1256) hawk 2005-02-26 18:18:09
  • Re:晕，原来是这样，谢啦 (41) jasonchen 2005-02-26 18:20:30
  • Re:c++能过，g++不行；应该还是程序有点问题 (23) iverson 2005-05-23 22:41:10
    • 同看不懂…… @_@ (27) Cubic 2005-08-04 20:58:21