Cod sursa(job #3162814)
Utilizator | Data | 29 octombrie 2023 23:20:43 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | py | Status | done |
Runda | Arhiva educationala | Marime | 0.12 kb |
n = int(input())
for i in range(n-1):
a, b = input().split()
a, b = int(a), int(b)
print(math.gcd(a,b))