Cod sursa(job #789825)
Utilizator | Vlad Badelita toranagah | Data | 19 septembrie 2012 15:59:21 |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
std::ifstream fin;
std::ofstream fout;
int gcd( int x, int y );
int main(int argc, char const *argv[])
{
int N, x, y;
fin.open("euclid2.in");
fin >> N;
fout.open("euclid2.out");
for( int i = 0; i < N; ++i )
{
fin >> x >> y;
fout << gcd(x, y) << '\n';
}
return 0;
}
int gcd( int x, int y )
{
return y == 0 ? x : gcd(y, x % y);
}