Cod sursa(job #2861091)
Utilizator | Data | 3 martie 2022 15:19:51 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | py | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
def gcd (a, b):
if b:
return gcd (b, a % b)
else:
return a
output = []
with open('euclid2.in') as f:
t = int(f.readline())
while t:
a, b = f.readline().split()
a = int(a)
b = int(b)
output.append(str(gcd(a, b)) + '\n')
t -= 1
with open('euclid2.out', 'w') as g:
g.writelines(output)