Cod sursa(job #2400131)
Utilizator | Data | 8 aprilie 2019 13:18:35 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
#include <fstream>
using namespace std;
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()
{
int T;
fin >> T;
for(int i{1}; i <= T; ++i){
int a, b;
fin >> a >> b;
fout << GCD(a, b) << "\n";
}
return 0;
}