Cod sursa(job #2154779)
Utilizator | Mihailescu Eduard-Florin mihailescu_eduard | Data | 7 martie 2018 12:03:37 |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int T,x,y;
int euclid(int x, int y)
{
int aux;
while(y!=0)
{
aux = y;
y = x % y;
x = aux;
}
return x;
}
int euclid_recursiv(int x , int y)
{
if(y == 0)
return x;
else
return euclid_recursiv(y, x % y);
}
int main()
{
fin >> T;
for(int i = 1; i<= T; ++i)
{
fin >> x >> y;
fout<<euclid(x,y) << endl;
}
return 0;
}