Cod sursa(job #664074)
Utilizator | Data | 19 ianuarie 2012 16:26:07 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
int cmmdc(int a, int b)
{
int r;
while (b)
{
r=a%b;
a=b;
b=r;
}
return a;
}
int main()
{
int n, i, a, b;
ifstream f("euclid.in");
ofstream g("euclid.out");
f>>n;
for (i=1; i<=n; i++)
{
f>>a>>b;
g<<cmmdc(a, b)<<endl;
}
f.close();
g.close();
return 0;
}