Cod sursa(job #1478984)
| Utilizator | Data | 30 august 2015 11:58:01 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.39 kb |
// Galatan Tudor - Ion Luca High School
// Husi, Romania, Su, August 30, 2015
#include <fstream>
using namespace std;
ifstream in ("euclid2.in");
ofstream out ("euclid2.out");
int n, i, a, b;
int gcd (int x, int y)
{
int r=0;
while (y)
{
r = x%y;
x = y;
y = r;
}
return x;
}
int main ()
{
in >> n;
for (i=1; i<=n; i++)
{
in >> a >> b;
out << gcd (a, b) << "\n";
}
return 0;
}