Cod sursa(job #2282365)
Utilizator | Data | 13 noiembrie 2018 17:52:19 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <fstream>
using namespace std;
ifstream fin ("euclid2.in");
ofstream fout ("euclid2.out");
int gcd(int a, int b) {
return (b == 0 ? a : gcd(b, a % b));
}
int main() {
int n;
fin >> n;
for (int i = 1, a, b; i <= n; ++i) {
fin >> a >> b;
fout << gcd(a, b) << '\n';
}
}