Cod sursa(job #2312456)
Utilizator | Data | 4 ianuarie 2019 21:17:28 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#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,a,b;
fin >> T;
for(int i = 1; i <= T; i++){
fin >> a >> b;
fout << GCD(a,b) << endl;
}
}