2949785_wa.c

来自「北大大牛代码 1240道题的原代码 超级权威」· C语言 代码 · 共 53 行

# include <stdio.h>

int s[6001];
int a, b, c, d;

int min(int p,int q)
{
	return p < q ? p : q;
}

void init()
{
	int i, n;
	int t1, t2, t3, t4, ta, tb, tc, td;

	a = 2;b = 3;c = 5;d = 7;
	s[0] = 1;
	i = 1;t1 = t2 = t3 = t4 = 0;
	while(i<=5842)
	{
		ta = a*s[t1]; tb = b*s[t2];tc = c*s[t3];td = d*s[t4];
		s[i] = min(min(ta,tb),min(td,tc));
		if(s[i]==ta)
			t1++;
		if(s[i]==tb)
			t2++;
		if(s[i]==tc)
			t3++;
		if(s[i]==td)
			t4++;
		i++;
	}
	while(scanf("%d",&n)==1,n)
	{
		printf("The %d",n);
		switch(n%10)
		{
		case 1:printf("st");break;
		case 2:printf("nd");break;
		case 3:printf("rd");break;
		default:printf("th");
		}
		printf(" humble number is %d.\n",s[n-1]);
	}
}

int main()
{
	init();
	return 1;
}