算法训练 Torry的困惑(基本型)

Problem:

Hint: 

1. 筛法求素数
2. 使用公式(a*b)%c = ((a%c)*(b%c))%c

AcCode:

import java.util.Scanner;

public class Main{
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int[] primes = new int[16000001];//筛法求素数
		int n = in.nextInt();
		primes[0] = 1;
		primes[1] = 1;
		int result = 1;
		int count = 0;
		for (int i = 2; i < primes.length; i++) {
			if(primes[i]==0) {
				result = ((result%50000)*(i%50000))%50000;//(a*b)%c = ((a%c)*(b%c))%c
				count++;
				if(count==n) {
					break;
				}
				int j = 2;
				while(i*j<primes.length) {
					primes[i*j] = 1;
					j++;
				}
			}
		}
		System.out.println(result);
	}
}