Cod sursa(job #2448972)
Utilizator | Data | 17 august 2019 18:15:15 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | py | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#!/usr/bin/env python3
def gcd(a, b):
return a if not b else gcd(b, a % b)
with open('euclid2.out', 'w') as fout:
fin = open('euclid2.in', 'r')
lines = fin.read().split('\n')
fin.close()
for i in range(int(lines[0])):
fout.write(str(gcd(*map(int, lines[i + 1].split()))) + '\n')