Cod sursa(job #2177356)
Utilizator | Data | 18 martie 2018 14:21:29 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <bits/stdc++.h>
#include <cassert>
using namespace std;
fstream f ("euclid2.in", ios::in);
fstream g ("euclid2.out", ios::out);
uint16_t gcd(uint16_t a, uint16_t b)
{ return (b == 0) ? a : gcd(b, a % b); }
int main()
{
uint16_t n; tuple<uint16_t, uint16_t> pr;
assert(f >> n);
for(uint16_t i = 0; i < n; i++)
{
assert(f >> get<0>(pr) >> get<1>(pr));
assert(g << gcd(get<0>(pr), get<1>(pr)) << "\n");
}
return 0;
}