Cod sursa(job #2449024)
Utilizator | Sachelarie Bogdan voyager | Data | 17 august 2019 21:15:58 |
---|---|---|---|
Problema | Algoritmul lui Euclid extins | Scor | 100 |
Compilator | py | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#!/usr/bin/env python3
import sys
sys.stdout = open('euclid3.out', 'w')
def gcd(a, b):
if b == 0:
return 1, 0, a
else:
x, y, d = gcd(b, a % b)
return y, x - a // b * y, d
with open('euclid3.in', 'r') as fin:
for _ in range(int(fin.readline())):
a, b, c = tuple(map(int, fin.readline().split()))
x, y, d = gcd(a, b)
if c % d != 0:
print('0 0')
else:
print(x * c // d, y * c // d)