[Algorithms] 깊이/넓이 우선 탐색 (DFS, BFS) 활용-알파코드(DFS)

def DFS(level, passcode):
    global cnt
 
    if level != 0:
        if passcode != code[:len(passcode)]:
            return
 
    if passcode == code:
        print(''.join(res))
        cnt+=1
    else:
        for i in range(1, 27):
            res.append(chr(64+i))   ###################### 대문자 A의 아스키코드가 64이므로##########
            DFS(level+1, passcode+str(i))
            res.pop()
 
 
if __name__ == '__main__':
 
   code = input()
   res = []
   cnt=0
   DFS(0, '')
   print(cnt)