отрезок
x1, y1,x2,y2 = map(int, input().split())
def nod(a, b):
--if b > 0:
return nod(b, a%b)
--else:
return a
a = abs(x1 - x2)
b = abs(y1 - y2)
d = nod(a, b)
print(d * (a//d + b//d - 1))
уравнение
def gcd(a, b):
while a != 0 and b != 0:
if a < b:
b = b % a
else:
a = a % b
return a + b
def qwer(a, b):
x = 1
x1 = 0
y = 0
y1 = 1
while b != 0:
q = a // b
r = a % b
x2 = x - q * x1
y2 = y - q * y1
a, b = b, r
x, x1 = x1, x2
y, y1 = y1, y2
return str(a), str(x), str(y)
a, b, c = list(map(int, input().split()))
x, y = 0, 0
gcds = 0
if c % gcd(a, b) != 0:
print('-1')
else:
gcds, x, y = map(int, qwer(a, b))
x *= c // gcds
y *= c // gcds
q = x // (b // gcds)
x %= b // gcds
y += a // gcds * q
print(x, y)
Задача 1) 36 (это 24₁₆).
Задача 2) 38 (это 26₁₆).
Объяснение:
Задача 1)
24₁₆ = 36₁₀ (24₁₆ = 16¹ * 2 + 16⁰ * 4 = 32+4 = 36₁₀)
37₈ = 31₁₀ (37₈ = 8¹ * 3 + 8⁰ * 7 = 24 + 7 = 31₁₀)
100001₂ = 33₁₀ (100001₂ = 2⁵ * 1 + 2⁴ * 0 + 2³ * 0 + 2² * 0 + 2¹ * 0 + 2⁰ * 1 = 32 + 0 + 0 + 0 + 0 + 1 = 33₁₀)
36 < 33 < 31
Задача 2)
26₁₆ = 38₁₀ (26₁₆ = 16¹ * 2 + 16⁰ * 6 = 32+6 = 38₁₀)
41₈ = 33₁₀ (41₈ = 8¹ * 4 + 8⁰ * 1 = 32+1 = 33₁₀)
100011₂ = 35₁₀ (100011₂ = 2⁵ * 1 + 2⁴ * 0 + 2³ * 0 + 2² * 0 + 2¹ * 1 + 2⁰ * 1 = 32 + 0 + 0 + 0 + 2 + 1 = 35₁₀)
38 < 35 < 33
