Cod sursa(job #554785)
Utilizator | Data | 15 martie 2011 09:29:17 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.28 kb |
#include<fstream.h>
ifstream f("euclid2.in");
ofstream g("euclid2.out");
long T, A, B;
long cmmdc(int A, int B)
{
if (!B) return A;
else return cmmdc(B, A%B);
}
int main()
{
f>>T;
for (int i=1;i<=T;i++)
{
f>>A; f>>B;
g<<cmmdc(A,B)<<endl;
}
return 0;
}