1
class Solution:
2
    def nthSuperUglyNumber(self, n: int, primes: List[int]) -> int:
3
        prime_nums = len(primes)
4
        index = [1] * prime_nums
5
        ret = [1] * (n + 1)
6
        for i in range(2, n + 1):
7
            ret[i] = min(primes[j] * ret[index[j]] for j in range(prime_nums))
8
            for k in range(prime_nums):
9
                if ret[i] == primes[k] * ret[index[k]]:
10
                    index[k] += 1
11

12
        return ret[-1]