Cod sursa(job #2003226)
Utilizator | Data | 22 iulie 2017 12:28:29 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | java | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
import java.util.Scanner;
public class Main {
private static int cmmdc(int a,int b)
{
int r;
while(b!=0)
{
r = a%b;
a = b;
b = r;
}
return a;
}
public static void main(String[] args) {
int n;
int a,b;
Scanner read = new Scanner(System.in);
n = read.nextInt();
while(n-- != 0)
{
a = read.nextInt();
b = read.nextInt();
System.out.println(cmmdc(a,b));
}
}
}