Cod sursa(job #2079876)
Utilizator | Data | 1 decembrie 2017 22:27:12 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
using namespace std;
long cmmdc(long a,long b)
{
if(!b)
return a;
return cmmdc(b,a%b);
}
int main()
{
ifstream in("euclid2.in");
ofstream out("euclid2.out");
int T;
long a,b;
in>>T;
for(int i=0;i<T;++i)
{
in>>a>>b;
out<<cmmdc(a,b)<<'\n';
}
in.close();
out.close();
return 0;
}