[백준 문제풀이] 얼렁뚱땅 2251 물통 풀이

https://www.acmicpc.net/problem/2251

2251번: 물통

 

a, b, c = map(int,input().split())
answer = set()
visited = []

def dfs(na,nb,nc) :
    global answer
    if [na,nb,nc] in visited:
        return
    else :
        visited.append([na,nb,nc])
    if na == 0 :
        answer.add(nc)
    if nb+na > b :
        temp = (nb+na)-b
        dfs(temp,b,nc)
    else :
        dfs(0,na+nb,nc)
    if nc+na < c :
        dfs(0, nb, nc+na)
    else :
        temp = (nc+na)-c
        dfs(temp,nb,c)
    if nb + na > a :
        temp = (nb+na)-a
        dfs(a,temp,nc)
    else :
        dfs(na+nb,0,nc)
    if nc + nb < c :
        dfs(na,0,nc+nb)
    else :
        temp = nc+nb-c
        dfs(na,temp,c)
    if nc + nb < b :
        dfs(na,nc+nb,0)
    else :
        temp = nc+nb-b
        dfs(na,b,temp)
    if nc + na < a :
        dfs(na+nc,nb,0)
    else :
        temp = nc + na - a
        dfs(a,nb,temp)

if a >= c : 
    dfs(c,0,0)
else :
    temp = c-a
    dfs(a,0,temp)
if b >= c :
    dfs(0,c,0)
else :
    temp = c-b
    dfs(0,b,temp)

an = list(answer)
an.sort()
print(*an)