3128852_ac_125ms_692k.cpp

北大大牛代码 1240道题的原代码 超级权威

#include <stdio.h>

__int64 inf = 1000000000000000000;
__int64 num[100000];
int n;

__int64 min(__int64 a,__int64 b)
{
	return a < b ? a : b;
}

int main()
{
	int i, i2, i3, i5, i7;
	__int64 n2, n3, n5, n7;

	num[1] = 1;
	i2 = i3 = i5 = i7 = 1;
	for(i = 2; ; i++)
	{
		n2 = num[i2]*2;
		n3 = num[i3]*3;
		n5 = num[i5]*5;
		n7 = num[i7]*7;
		num[i] = min(min(n2,n3),min(n5,n7));
		if(num[i]==n2)	i2++;
		if(num[i]==n3)	i3++;
		if(num[i]==n5)	i5++;
		if(num[i]==n7)	i7++;
		if(num[i] >= inf)
		{
			break;
		}
	}
	scanf("%d",&n);
	while(n--)
	{
		scanf("%d",&i);
		printf("%I64d\n",num[i]);
	}
	return 0;
}