Cod sursa(job #306276)
Utilizator | Data | 20 aprilie 2009 10:57:59 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.28 kb |
#include <fstream.h>
ifstream f("euclid2.in");
ofstream g("euclid2.out");
long cmmdc (long a, long b)
{ if (b==0) return a;
return cmmdc(b,a%b);
}
int main ()
{ long t,a,b;
f>>t;
for (int i=1; i<=t; i++)
{ f>>a>>b;
g<<cmmdc(a,b)<<'\n';
}
return 0;
}