Cod sursa(job #2916926)
Utilizator | Data | 2 august 2022 14:02:28 | |
---|---|---|---|
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");
int cmmdc(int a, int b)
{
if(b == 0)
return a;
return cmmdc(b, a % b);
}
int main()
{
int n; fin >> n;
for(int i = 1; i <= n; ++i)
{
int a, b; fin >> a >> b;
fout << cmmdc(a, b) << '\n';
}
return 0;
}