Cod sursa(job #3370348)
| Utilizator | Data | 25 octombrie 2026 18:21:35 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 0 |
| Compilator | py | Status | done |
| Runda | Arhiva educationala | Marime | 0.11 kb |
import math
T = int(input())
for _ in range(T):
a, b = map(int, input().split())
print(math.gcd(a, b))
