1.0 KB | 1064 chars
"""
[30349: Taikinys](https://www.acmicpc.net/problem/30349)
Tier: Bronze 2
Category: bruteforcing, implementation, math
"""
import sys
from math import sqrt, pi, sin, factorial, ceil, floor
from datetime import datetime, timedelta
SYS_INPUT = True
RECURSION_LIMIT = 10 ** 7
SET_RECURSION = False
BLANK = " "
if SET_RECURSION:
sys.setrecursionlimit(RECURSION_LIMIT)
inp = lambda : sys.stdin.readline().rstrip() if SYS_INPUT else input()
mii = lambda : [*map(int,inp().split())]
mfi = lambda : [*map(float,inp().split())]
ii = lambda : int(inp())
fi = lambda : float(inp())
isplit = lambda : inp().split()
p = print
def gcd(a, b): return gcd(b, a % b) if b > 0 else a
def lcm(a, b): return a * b // gcd(a, b)
def solve():
n, m = mii()
a, b = mii()
c, d = mii()
ans = 1e30
for i in range(n + 1):
for j in range(m + 1):
if 0 <= i + c < a and 0 <= j + d < b:
ans = min(ans, abs(i + c) + abs(j + d))
p(ans if ans < 1e30 else "NEPATAIKYS")
if __name__ == "__main__":
tc = 1
for t in range(1, tc+1):
ret = solve()