Cod sursa(job #289872)
Utilizator | Data | 27 martie 2009 09:10:20 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <fstream.h>
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int cmmdc(int x,int y)
{
int r=x%y;
while(r!=0)
{x=y;
y=r;
r=x%y;
}
return y;
}
int main()
{
int n,a,b;
f>>n;
while(n!=0)
{
f>>a;
f>>b;
if(b>a) g<<cmmdc(b,a)<<"\n";
else g<<cmmdc(a,b)<<"\n";
n--;
}
f.close();
g.close();
return 0;
}