Cod sursa(job #2309134)
Utilizator | Data | 28 decembrie 2018 14:58:01 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
using namespace std;
int gcd(int x, int y)
{
int c1 = x, c2 = y;
while(x != y)
{
if(x > y)
x -= y;
else
y -= x;
}
return y;
}
ifstream in("euclid2.in");
ofstream out("euclid2.out");
int main()
{
int n, a, b;
in >> n;
for(int i = 0; i < n; i++)
{
in >> a >> b;
out << gcd(a, b) << endl;
}
in.close();
out.close();
return 0;
}