[기초] 백준 1110번 더하기 사이클 with python3

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

1110번: 더하기 사이클

문제

 

내 풀이

def dfs(num):
    global count
    sth = int(num)
    num = str(num)

    if sth == n and count > 0:
        return

    if len(num) == 2:
        first = int(num[0])
        second = int(num[1])
        third = str(first + second)

        if len(third) == 1:
            next = str(second) + str(third)
            count += 1
            dfs(next)
        else:
            next = str(second) + str(third[1])
            count += 1
            dfs(next)

    elif num == '0':
        count += 1
        return

    elif len(num) == 1:
        first = 0
        second = int(num)
        third = str(second)
        # print(f'check{third}')

        if len(third) == 1:
            next = str(second) + str(third)
            count += 1
            dfs(next)

            # 재귀가 안멈춰
        elif len(third) == 2:
            next = str(second) + str(third[1])
            count += 1
            dfs(next)


if __name__ == "__main__":
    n = int(input())
    count = 0
    dfs(n)

    print(count)

해설

 

 

정답 풀이

#추가예정

출처:

 

해석