313. Super Ugly Number

Write a program to find the nth super ugly number.

Super ugly numbers are positive numbers whose all prime factors are in the given prime list primes of size k. For example, [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.

Note:
(1) 1 is a super ugly number for any given primes.
(2) The given numbers in primes are in ascending order.
(3) 0 < k ≤ 100, 0 < n ≤ 106, 0 < primes[i] < 1000.

题目就是在264 Ugly Number II的基础上，把2，3，5变成了K长的数组。
题目264：http://blog.csdn.net/a342500329a/article/details/51224120
思路是一样的，只要理解了264再来做这个题目就很简单了。

class Solution {
public:
    int nthSuperUglyNumber(int n, vector<int>& primes) {
        vector<int>a(n);
        int len=primes.size();
        vector<int>index(len);
        a[0]=1;
        for(int i=1;i<n;i++){
            int minn=INT_MAX;
            for(int j=0;j<len;j++){
                minn=min(minn,primes[j]*a[index[j]]);
            }
            a[i]=minn;
            for(int j=0;j<len;j++){
                if(minn%primes[j]==0){
                    index[j]++;
                }
            }
        }
        return a[n-1];
    }
};