POJ Problem 3910 GCD Determinant

最新推荐文章于 2020-02-26 13:41:26 发布

linian8123654

最新推荐文章于 2020-02-26 13:41:26 发布

阅读量367

点赞数

文章标签： ACM题解 poj java

本文链接：https://blog.csdn.net/linian8123654/article/details/52983168

版权

import java.util.Scanner;

public class beta {
	  public static long det(int n){
		  long ans = n;
		  for(int i =  2; i*i <= n; ++i){
			  if(n%i == 0){
				  ans = ans/i*(i-1);
				  while(n%i == 0) n/= i;
			  }
		  }
		  if(n > 1)
			  ans = ans/n*(n-1);
		  return ans;
	  }
	  public static void main(String args[]) {
		  	Scanner in = new Scanner(System.in);
		  	while(in.hasNext()){
		  		int n = in.nextInt();
		  		int arr[] = new int[n];
		  		for(int i  = 0; i < n; ++i)
		  			arr[i] = in.nextInt();
		  		long ans = 1;
		  		for(int i = 0; i < n; ++i){
		  			ans = ans * det(arr[i]);
		  			if(ans >= 1000000007)
		  				ans = ans %1000000007;
		  		}
		  		System.out.println(ans);
		  	}
	    }
}