Cod sursa(job #222855)
| Utilizator |  Stefan Marius Deaconu marius.stefan |
Data | 25 noiembrie 2008 19:32:45 |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.34 kb |
#include <fstream.h>
int cmmdc(int a, int b)
{ int r=a%b;
while (r!=0)
{ a=b;
b=r;
r=a%b;
}
return b;
}
int main ()
{
ifstream in("euclid2.in");
ofstream out("euclid2.out");
int n, i, a, b, c;
in>>n;
for (i=1; i<=n;i++)
{ in>>a; in>>b;
c=cmmdc(a,b);
out<<c<<endl;
}
out.close();
return 0;
}