Cod sursa(job #2751109)
Utilizator | Data | 14 mai 2021 11:27:10 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int gcd(int a, int b) {
if(b == 0) {
return a;
}
return gcd(b, a % b);
}
int main() {
int T;
for(fin >> T; T--; ) {
int a, b;
fin >> a >> b;
fout << gcd(a, b) << '\n';
}
return 0;
}