You are viewing a single comment's thread. Return to all comments →
All test case pass ` import java.io.; import java.util.;
public class Solution {
public static void main(String[] args) { int N = 1000000; int[] phi = new int[N + 1]; for(int i = 0; i < phi.length; i++) { phi[i] = i; } for(int i = 2; i <= N; i++) { if(phi[i] == i) { for(int k = 1; k * i <= N; k++) { phi[k * i] -= phi[k * i] / i; } } } long[] sums = new long[phi.length]; for(int i = 2; i <= N; i++) { sums[i] = sums[i - 1] + phi[i]; } try(Scanner sc = new Scanner(System.in)) { int T = sc.nextInt(); while(T > 0) { N = sc.nextInt(); System.out.println(sums[N]); T--; } } }
}
Seems like cookies are disabled on this browser, please enable them to open this website
Project Euler #72: Counting fractions
You are viewing a single comment's thread. Return to all comments →
All test case pass ` import java.io.; import java.util.;
public class Solution {
}