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