Super ugly numbers are positive numbers whose all prime factors are in the given prime list. Given a number n, the task is to find n’th Super Ugly number.
It may be assumed that given set of primes is sorted. Also, first Super Ugly number is 1 by convention.
Input : primes = [2, 5] n = 5 Output : 8 Super Ugly numbers with given prime factors are 1, 2, 4, 5, 8, ... Fifth Super Ugly number is 8 Input : primes = [2, 3, 5] n = 50 Output : 243 Input : primes = [3, 5, 7, 11, 13] n = 9 Output: 21
In our previous post we discussed about Ugly Number. This problem is basically extension of Ugly Numbers.
A simple solution for this problem is to one by one pick each number starting from 1 and find its all primes factors, if all prime factors lie in the given set of primes that means number is Super Ugly. Repeat this process until we get n’th Super Ugly Number .
An efficient solution for this problem is similar to Method-2 of Ugly Number. Here is the algorithm :
- Let k be size of given array of prime numbers.
- Declare a set for super ugly numbers.
- Insert first ugly number (which is always 1) into set.
- Initialize array multiple_of[k] of size k with 0. Each element of this array is iterator for corresponding prime in primes[k] array.
- Initialize nextMultipe[k] array with primes[k]. This array behaves like next multiple variables of each prime in given primes[k] array i.e; nextMultiple[i] = primes[i] * ugly[++multiple_of[i]].
- Now loop until there are n elements in set ugly.
a). Find minimum among current multiples of primes in nextMultiple array and insert it in the set of ugly numbers.
b). Then find this current minimum is multiple of which prime .
c). Increase iterator by 1 i.e; ++multiple_Of[i], for next multiple of current selected prime and update nextMultiple for it.
Below is implementation of above steps.
This article is contributed by Shashank Mishra ( Gullu ). If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.