Cod sursa(job #946907)
Utilizator | SAlexandru BitOne | Data | 6 mai 2013 12:09:14 |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <cstdlib>
#include <fstream>
using namespace std;
inline int gcd(int x, int y)
{
return !y ? x : gcd(y, x % y);
}
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;
}