Cod sursa(job #1190805)
Utilizator | SAlexandru BitOne | Data | 25 mai 2014 18:00:15 |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <fstream>
#include <cstdlib>
using namespace std;
int gcd(int a, int b)
{
return !b ? a : gcd(b, a % b);
}
int main()
{
int T, a, b;
ifstream in{"euclid2.in"};
ofstream out{"euclid2.out"};
for(in >> T; T; --T)
{
in >> a >> b;
out << gcd(a, b) << '\n';
}
return EXIT_SUCCESS;
}