Cod sursa(job #2917268)
Utilizator | Data | 4 august 2022 06:24:09 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int gcd(int a, int b) {
if (b == 0) return a;
return gcd(b, a % b);
}
int main() {
int t, a, b, d;
f >> t;
for (int i = 0 ; i < t ; i++) {
f >> a >> b;
if (a > b)
d = gcd(a, b);
else
d = gcd(b, a);
g << d << "\n";
}
return 0;
}