Cod sursa(job #3214633)
Utilizator | Data | 14 martie 2024 11:44:25 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int main()
{
f >> n;
for (int i = 1; i <= n; ++i)
{
int x, y;
f >> x >> y;
while (y)
{
int r = x % y;
y = x;
x = r;
}
g << y << '\n';
}
f.close();
g.close();
return 0;
}