Cod sursa(job #2408121)
Utilizator | Data | 17 aprilie 2019 17:16:46 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <iostream>
#include <fstream>
using namespace std;
int n, x, y;
int euclid(int a, int b)
{
int x = a, y = b;
int c;
while (b)
{
c = a % b;
a = b;
b = c;
}
//if(x < y)
// return x / a;
//else
// return y / a;
return a;
}
int main()
{
ifstream in ("euclid2.in");
ofstream out ("euclid2.out");
in >> n;
for(int i = 0; i < n; i++)
{
in >> x >> y;
out << euclid(x, y);
}
return 0;
}