1. Write a program to find the nth super ugly number. 2. Super ugly numbers are positive numbers whose all prime factors are in the given prime list primes of size k. 3. 1 is a super ugly number for any given primes. Input: n = 12, primes = [2,7,13,19] Output: 32 Explanation: [1,2,4,7,8,13,14,16,19,26,28,32] is the sequence of the first 12 super ugly numbers given primes = [2,7,13,19] of size 4.
Input Format
First line contains integer n. Second line contains an integer L(size of the primes array) Third line ccontains L prime numbers.
Output Format
Return an integer
Constraints
The given numbers in primes are in ascending order. 0 < k <= 100, 0 < n <= 106, 0 < primes[i] < 1000. The nth super ugly number is guaranteed to fit in a 32-bit signed integer.
Notice
Try First, Check Solution later
1. You should first read the question and watch the question video.2. Think of a solution approach, then try and submit the question on editor tab.3. We strongly advise you to watch the solution video for prescribed approach.Example
Input
12 4 2 7 13 19
Output
32