← Back to List

25166번: 배고픈 아리의 샌드위치 구매하기 ↗

Solutions

Python 3
286 B | 286 chars
def solution(s, m):
  if s < 1024:
    return "No thanks"

  d = s - 1023
  k = 512

  while k > 0:
    if m >= k:
      m -= k
      if d >= k:
        d -= k

    k //= 2

  if d > 0:
    return "Impossible"

  return "Thanks"


s, m = map(int, input().split())
print(solution(s, m))