Cod sursa(job #158597)
Utilizator | Rares Buhai darren | Data | 13 martie 2008 18:30:50 |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include<fstream.h>
int cmmdc(long a,long b);
int main()
{
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
long a,b,n;
fin>>n;
for (int i=0;i<n;i++)
{
fin>>a>>b;
fout<<cmmdc(a,b);
}
fin.close();
fout.close();
return 0;
}
int cmmdc(int a,int b)
{
if (a==0)
return b;
if (b==0)
return a;
while (a!=b)
{
if(a>b)
a=a-b;
if(b>a)
b=b-a;
}
return a;
}