Cod sursa(job #2448975)
Utilizator | Sachelarie Bogdan voyager | Data | 17 august 2019 18:18:29 |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | py | Status | done |
Runda | Arhiva educationala | Marime | 0.26 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')
for i in range(int(fin.readline())):
gcd(*map(int, fin.readline().split()))
fin.close()