Cod sursa(job #1118246)
Utilizator | Data | 24 februarie 2014 09:23:40 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include<fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int cmmdc(int a, int b)
{
while(a!=b)
{
if(a>b)
a=a-b;
if(b>a)
b=b-a;
}
return a;
}
int main ()
{ int n,a,b,i;
fin>>n;
for(i=0;i<n;i++)
{ fin>>a>>b;
fout<<cmmdc(a,b);
fout<<"\n";
}
}