Cod sursa(job #2448993)
Utilizator | Sachelarie Bogdan voyager | Data | 17 august 2019 18:59:41 |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | py | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#!/usr/bin/env python3
import sys
sys.stdout = open('euclid2.out', 'w', buffering=512)
def gcd(a, b):
while b:
a, b = b, a % b
else:
return a
fin = open('euclid2.in', 'r', buffering=1024)
for i in range(int(fin.readline())):
line = fin.readline()
splitIdx = line.index(' ')
a = int(line[:splitIdx])
b = int(line[splitIdx+1:])
print(gcd(a, b))
sys.stdout.close()