Cod sursa(job #2199733)
Utilizator | Data | 28 aprilie 2018 21:14:38 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
long long a,b,r,n,i;
int cmmdc (int a, int b)
{
if (b==0)
return a;
else return cmmdc(b,a%b);
}
int main()
{
fin>>n;
for (i=1;i<=n;i++)
{fin>>a>>b;
fout<<cmmdc(a,b);
fout<<endl;}
return 0;
}