Cod sursa(job #1991655)
| Utilizator | Data | 17 iunie 2017 20:13:26 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 0 |
| Compilator | java | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
import java.util.Scanner;
/**
* Created by vvats on 05/06/17.
*/
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int t = scanner.nextInt();
while (t-- > 0) {
int a = scanner.nextInt();
int b = scanner.nextInt();
if (a > b) {
System.out.println(gcd(a, b));
} else {
System.out.println(gcd(b, a));
}
}
}
private static int gcd(final int a, final int b) {
if (b == 0) return a;
return gcd(b, a%b);
}
}
