Cod sursa(job #1462649)
Utilizator | FMI Filiuta Marius FiliutaMarius | Data | 18 iulie 2015 17:27:43 |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | java | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
import java.io.*;
import java.util.Scanner;
public class Main {
public static void main(String[] args) throws IOException {
File in = new File("euclid2.in");
FileWriter out = new FileWriter("euclid2.out");
Scanner sin = new Scanner(in);
int T,a,b;
T = sin.nextInt();
while(T-- >0)
{
a = sin.nextInt();
b = sin.nextInt();
out.write(String.valueOf(cmmdc(a,b)) + '\n');
}
sin.close();
//in.close();
out.close();
}
private static int cmmdc(int a, int b)
{
if(b==0)
return a;
return cmmdc(b,a%b);
}
}