Coprimes
时间限制:
500 ms | 内存限制:
4096 KB
难度:
1
-
描述
-
For given integer N (1
<=N
<=10
4) find amount of positive numbers not greater than N that coprime with N. Let us call two positive integers (say, A and B, for example) coprime if (and only if) their greatest common divisor is 1. (i.e. A and B are coprime iff gcd(A,B) = 1).
-
输入
- Input file contains integer N.( 注意:程序以文件结束符“EOF”结束输入。) 输出
- Write answer in output file. 每个数字占一行。 样例输入
-
9
样例输出
-
6
-
java 代码:
-
import java.util.Scanner;
public class Main{
public static void main(String[] args) { Scanner in = new Scanner(System.in); while (in.hasNext()) { int n = in.nextInt(); int cnt = 0; for (int i = 1; i < n; i++) { if (gcd(n, i) == 1) { cnt++; } } System.out.println(cnt);
}
}
private static int gcd(int a, int b) {
if (b == 0) return a; else return gcd(b, a % b);
}
}