Cod sursa(job #2225066)
Utilizator | Data | 25 iulie 2018 20:08:14 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int gcd(int a, int b) {
if (!b) return a;
return gcd(b, a % b);
}
int main()
{
int a, b, i;
int T;
f >> T;
for (i = 1; i <= T; i++)
{
f >> a >> b;
g << gcd(a, b) << endl;
}
return 0;
}