[백준-2251] 물통 / Python

2251번: 물통

import sys
from collections import deque

input = sys.stdin.readline

def bfs():
    while queue:
        x, y, z = queue.popleft()
        if check[x][y] == 1:
            continue
        check[x][y] = 1
        if x == 0:
            answer[z] = 1
        if x + y > b:
            queue.append([x + y - b, b, z])
        else:
            queue.append([0, x + y, z])
        if x + z > c:
            queue.append([x + z - c, y, c])
        else:
            queue.append([0, y, x + z])
        if y + x > a:
            queue.append([a, y + x - a, z])
        else:
            queue.append([y + x, 0, z])
        if y + z > c:
            queue.append([x, y + z - c, c])
        else:
            queue.append([x, 0, y + z])
        if z + x > a:
            queue.append([a, y, z + x - a])
        else:
            queue.append([z + x, y, 0])
        if z + y > b:
            queue.append([x, b, z + y - b])

a, b, c = map(int, input().split())
check = [[0] * 201 for _ in range(201)]
answer = [0] * 201
queue = deque()
queue.append((0, 0, c))
bfs()

for i in range(201):
    if answer[i]:
        print(i, end=" ")

 

해설

a -> b

a -> c

b -> a

b -> c

c -> a

c -> b

6가지 경우의 수를 계산해주면서 bfs해준다.