Cod sursa(job #1627675)
| Utilizator | Data | 3 martie 2016 18:19:16 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 60 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include <iostream>
#include <fstream>
using namespace std;
int cmmdc(long x,long y)
{
if(x!=y)
{
if(x>y)
return cmmdc(x-y,y);
else
if(x<y)
return cmmdc(x,y-x);
}
return x;
}
int main()
{
long T,a,b;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
f>>T;
for(int i=1;i<=T;i++)
{
f>>a>>b;
g<<cmmdc(a,b)<<"\n";
}
f.close();
g.close();
return 0;
}
