mirror of
https://github.com/tiennm99/CSX101.git
synced 2026-06-06 02:13:32 +00:00
30 lines
473 B
Python
30 lines
473 B
Python
n = int(input())
|
|
k = int(input())
|
|
p = int(input())
|
|
q = int(input())
|
|
alice = 2*(p - 1) + q
|
|
bob = alice - k
|
|
b = False
|
|
if (bob > 0):
|
|
b = True
|
|
v = bob % 2
|
|
if v == 0:
|
|
v = 2
|
|
pass
|
|
u = (bob - v)/2 + 1
|
|
else:
|
|
bob = alice + k
|
|
if (bob <= n):
|
|
b = True
|
|
v = bob % 2
|
|
if v == 0:
|
|
v = 2
|
|
pass
|
|
u = (bob - v)/2 + 1
|
|
pass
|
|
if b:
|
|
u = int(u)
|
|
v = int(v)
|
|
print(u, v)
|
|
else:
|
|
print(-1) |