Cod sursa(job #2648531)
Utilizator | Data | 11 septembrie 2020 13:02:01 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include<fstream>
using namespace std;
long long n,x,y;
long long cmmdc(long long x,long long y)
{
while(y)
{
int r=x%y;
x=r;
y=r;
}
return x;
}
int main()
{
ifstream f("euclid2.in");
ofstream g("euclid2.out");
f>>n;
for(int i=1;i<=n;i++)
{
f>>x>>y;
if(x>y)
g<<cmmdc(x,y)<<endl;
else
g<<cmmdc(y,x)<<endl;
}
f.close();
g.close();
return 0;
}