Programmers 모음 사전

import sys

vowels = ['A', 'E', 'I', 'O', 'U']
sys.setrecursionlimit(100000)

arr = []


def dfs(v, depth):
    if depth > 5:
        return
    arr.append(v)
    for vowel in vowels:
        dfs(v + vowel, depth + 1)


def solution(word):
    dfs('', 0)
    print(arr)
    for i in range(len(arr)):
        if arr[i] == word:
            return i

from itertools import product

solution = lambda word: sorted(["".join(c) for i in range(5) for c in product("AEIOU", repeat=i+1)]).index(word) + 1

def solution(word):
    answer = 0
    for i, n in enumerate(word):
        answer += (5 ** (5 - i) - 1) / (5 - 1) * "AEIOU".index(n) + 1
    return answer