Cod sursa(job #2448987)
| Utilizator | Data | 17 august 2019 18:41:02 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 0 |
| Compilator | py | Status | done |
| Runda | Arhiva educationala | Marime | 0.29 kb |
#!/usr/bin/env python3
import sys
sys.stdout = open('euclid2.out', 'w', buffering=1024)
def gcd(a, b):
return a if not b else gcd(b, a % b)
fin = open('euclid2.in', 'r', buffering=1024)
for i in range(int(fin.readline())):
gcd(*map(int, fin.readline().split()))
sys.stdout.close()
