Cod sursa(job #600643)
Utilizator | Data | 2 iulie 2011 18:10:36 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
int n;
inline int cmmdc(int a, int b)
{
int ax;
while(b)
{
ax = a % b;
a = b;
b = ax;
}
return a;
}
int main()
{
int i, a, b;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
f >> n;
for(i = 1; i <= n; ++i)
{
f >> a >> b;
g << cmmdc(a, b) << '\n';
}
g.close();
return 0;
}