Cod sursa(job #1558931)
Utilizator | Data | 29 decembrie 2015 19:56:23 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <iostream>
#include<fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int cmmdc(long int a,long int b)
{if(b==0) return a;
return cmmdc(b, a % b);
}
int main()
{int T,i;
long int x,y;
fin>>T;
for(i=1;i<=T;i++)
{fin>>x>>y;
fout<<cmmdc(x,y)<<endl;
}
return 0;
}