Cod sursa(job #2514962)
Utilizator | Data | 27 decembrie 2019 14:18:05 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
long long GCD(long long a,long long b)
{
if(!b)
return a;
else
return GCD(b,a%b);
}
int main()
{
long long T,a,b;
fin>>T;
for(long long i=1;i<=T;i++)
{
fin>>a>>b;
fout<<GCD(a,b)<<"\n";
}
return 0;
}