NYOJ 225 小明求素数积

小明求素数积

时间限制： 1000  ms  |  内存限制： 65535  KB

难度： 1

描述

小明最近遇到了一个素数题，是给你一个正整数N（2=<N<=1000）让你求出2~N的所有素数乘积的后六位。

 

输入

第一行输入一个正整数T(T<=20)表示有T组数据
每组数据占一行，输入一个正整数N（2=<N<=1000）

输出

每组数据输出占一行，输出2~N素数乘积的后六位

样例输入

3
3
6
43

样例输出

6
30
670030

 

#include <stdio.h>

int a[] = {2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,
107,109,113,127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199,211,
223,227,229,233,239,241,251,257,263,269,271,277,281,283,293,307,311,313,317,331,
337,347,349,353,359,367,373,379,383,389,397,401,409,419,421,431,433,439,443,449,
457,461,463,467,479,487,491,499,503,509,521,523,541,547,557,563,569,571,577,587,
593,599,601,607,613,617,619,631,641,643,647,653,659,661,673,677,683,691,701,709,
719,727,733,739,743,751,757,761,769,773,787,797,809,811,821,823,827,829,839,853,
857,859,863,877,881,883,887,907,911,919,929,937,941,947,953,967,971,977,983,991,
997};

int main()
{
	int m,n;
	scanf("%d",&m);
	while (m--)
	{
		int i = 1,j;
		scanf("%d",&n);
		int sum = a[0];
		while (a[i] < n && i< (sizeof(a)/sizeof(a[0])))
		{
			i++;
		}
		if (a[i] != n)
		{
			i--;
		}
		for (j=1; j<=i; j++)
		{
			sum *= a[j];
			if (sum >= 1000000)
			{
				sum %= 1000000;
			}
		}
		printf("%d\n",sum);
	}
	return 0;
}