← Back to List

28063번: 동전 복사 ↗

Solutions

Python 3
754 B | 754 chars
import sys
from math import sqrt, pi, sin, factorial, ceil, floor
from datetime import datetime, timedelta
# sys.setrecursionlimit(10**7)

BLANK = " "

# inp = input
inp = lambda : sys.stdin.readline().rstrip()
mii = lambda x = BLANK : [*map(int,inp().split(x))]
mfi = lambda x = BLANK : [*map(float,inp().split(x))]
ii = lambda : int(inp())
fi = lambda : float(inp())
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 = ii()
	x, y = mii()

	if n == 1:
		return 0
	
	if (x == 1 or x == n) and (y == 1 or y == n):
		return 2
	
	if (x == 1 or x == n) or (y == 1 or y == n):
		return 3
	
	return 4


if __name__ == "__main__":
	tc = 1
	for t in range(1, tc+1):
		ret = solve()
		p(ret)