Cod sursa(job #2285377)
Utilizator | Data | 18 noiembrie 2018 15:16:22 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fi("euclid2.in");
ofstream fo("euclid2.out");
int nrTeste;
int gcd(int a, int b)
{
if (!b) return a;
return gcd(b, a % b);
}
int main()
{
fi>>nrTeste;
for(int test=1; test<=nrTeste; test++)
{
int a,b;
fi>>a>>b;
fo<<gcd(a,b)<<"/n";
}
return 0;
}