Cod sursa(job #2249454)
Utilizator | Data | 29 septembrie 2018 21:37:05 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <algorithm>
#include <fstream>
using namespace std;
int q, x, y;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int gcd(int x, int y)
{
int r = 0;
while(y != 0) {
r = x % y;
x = y;
y = r;
}
return x;
}
int main()
{
f >> q;
while(q --) {
f >> x >> y;
g << gcd(x, y) << '\n';
}
return 0;
}