Cod sursa(job #1558075)
| Utilizator | Data | 28 decembrie 2015 17:51:41 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 0 |
| Compilator | java | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
import java.io.*;
import java.util.*;
/**
* Created by Aetheryon on 28.12.2015.
*/
public class Main{
public static void main(String[] args) throws IOException{
Scanner in = new Scanner(new FileInputStream("euclid2.in"));
PrintStream out = new PrintStream("euclid2.out");
/* int t = in.nextInt();
for (int i=1;i<=t;++i){
int a = in.nextInt();
int b = in.nextInt();
out.print(gcd(a,b) + "\n");*/
}
}
public static int gcd(int a,int b){
return (a==0) ? b : gcd(b%a,a);
}
}
