Cod sursa(job #2428615)
Utilizator | Data | 5 iunie 2019 21:51:32 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <iostream>
#include <fstream>
using namespace std;
int cmmmdc(int x,int y)
{
int i=y,j=x,r;
if(x>y)
{
i = x;
j = y;
}
r = i%j;
while(r!=0)
{
i = j;
j = r;
r = i%j;
}
return j;
}
int main()
{
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int t;
fin>>t;
for(int i = 0,x,y;i<t;i++)
{
fin>>x>>y;
fout<<cmmmdc(x,y)<<endl;
}
return 0;
}