Cod sursa(job #2199859)
Utilizator | Data | 29 aprilie 2018 13:06:39 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
using namespace std;
int cmmdc(long long a,long long b)
{
if(b==0)
return a;
else
cmmdc(b,a%b);
}
int main()
{
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int n;
fin>>n;
long long a,b;
for(int i=0;i<n;i++)
{
fin>>a>>b;
fout<<cmmdc(a,b)<<'\n';
}
return 0;
}