Cod sursa(job #2450543)
Utilizator | Data | 23 august 2019 16:52:07 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("euclid2.in");
ofstream out("euclid2.out");
int euclid(int a, int b){
if(!b) return a;
return euclid(b, a % b);
}
int main()
{
int n;
in >> n;
for(int i = 0; i < n; ++i){
int a, b;
in >> a >> b;
out << euclid(a, b) << endl;
}
return 0;
}