Cod sursa(job #2694035)
Utilizator | Data | 7 ianuarie 2021 21:29:26 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 60 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int Euclid(int m, int n)
{
while(m!=n)
if(n<m)
m=m-n;
else
n=n-m;
return n;
}
int main()
{
long long n, i, x, y;
fin >> n;
for(i=1; i<=n; i++)
{
fin >> x >> y;
fout << Euclid(x,y) <<"\n";
}
return 0;
}