Cod sursa(job #2342994)
Utilizator | Data | 13 februarie 2019 16:35:20 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <iostream>
#include <fstream>
using namespace std;
int T, a, b;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int GCD(int a, int b){
if(b == 0) return a;
return GCD(b, a%b);
}
int main()
{
fin >> T;
for(int i = 0; i < T; i++){
fin >> a >> b;
fout << GCD(a,b) << "\n";
}
return 0;
}