Cod sursa(job #157913)
Utilizator | Data | 13 martie 2008 12:56:37 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include<fstream.h>
ifstream f("cmmdc.in");
ofstream g("cmmdc.out");
int cmmdc1(int a, int b)
{int r;
r=a%b;
while(r)
{
a=b;
b=r;
r=a%b;
}
return b;
}
int main()
{ int a,b,n;
f>>n;
for(i=0;i<n;i++)
{f>>a>>b;
g<<cmmdc1(a,b)<<endl;
f.close();
g.close();
return 0;
}