Cod sursa(job #2613884)
Utilizator | Data | 10 mai 2020 20:09:34 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("euclid2.in");
ofstream fout ("euclid2.out");
int cmmdc (int nr1, int nr2){
if (!nr2)
return nr1;
return cmmdc(nr2, nr1 % nr2);
}
int main()
{
int n, nr1, nr2;
fin >> n;
for (int i = 1; i <= n; i++)
{
fin >> nr1 >> nr2;
fout << cmmdc(nr1, nr2) << endl;
}
return 0;
}