Cod sursa(job #2430533)
Utilizator | Data | 15 iunie 2019 12:22:36 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("da.in");
int div(int a, int b) {
if (!b)
return a;
return div(b, a % b);
}
int main()
{
int a, b, t;
in >> t;
for(int i = 1; i <= t; i++) {
in >> a >> b;
cout << div(a, b) << "\n";
}
return 0;
}