Cod sursa(job #936594)
Utilizator | Data | 7 aprilie 2013 20:45:39 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include<fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
long a,b;
int t;
long cmmdc(long a, long b)
{while (a != b)
if (a > b)
a = a-b;
else
b = b-a;
return a;
}
int main()
{f>>t;
for(int i = 0; i < t; i++) {
f>>a>>b;
g<<cmmdc(a,b)<<endl;
}
f.close();
g.close();
return 0;
}