Cod sursa(job #3037991)
Utilizator | Data | 26 martie 2023 18:46:32 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <bits/stdc++.h>
using namespace std;
int cmmdc(int a, int b) {
if(a == 0) return b;
return cmmdc(b % a, a);
}
int main()
{
int n, a, b;
ifstream in("euclid2.in");
ofstream out("euclid2.out");
in >> n;
for(int i = 0; i < n; ++i) {
in >> a >> b;
out << cmmdc(a, b) << "\n";
}
return 0;
}