Mai intai trebuie sa te autentifici.
Cod sursa(job #2301003)
| Utilizator | Data | 12 decembrie 2018 15:06:11 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 0 |
| Compilator | java | Status | done |
| Runda | Arhiva educationala | Marime | 0.74 kb |
import java.io.*;
import java.util.*;
public class Main {
private static final String INPUT_FILE_PATH = "euclid2.in";
private static final String OUTPUT_FILE_PATH = "euclid2.out";
public static void main(String[] args) throws IOException {
Scanner sc = new Scanner(new FileReader(INPUT_FILE_PATH));
int n = sc.nextInt();
PrintWriter pw = new PrintWriter(OUTPUT_FILE_PATH);
while (n-- > 0) {
int a = sc.nextInt();
int b = sc.nextInt();
pw.println(MathUtils.gcd(a, b));
}
pw.flush();
}
private static class MathUtils {
static int gcd(int a, int b) {
return (b == 0) ? a : gcd(b, a % b);
}
}
}
