Codebuddy week13

SmallestSequenceWithGivenPrimes.py

import heapq

class Solution:
    # @param A : integer
    # @param B : integer
    # @param C : integer
    # @param D : integer
    # @return a list of integers
    def solve(self, A, B, C, D):
        
        l = [A, B, C]
        ol = l[:]
        heapq.heapify(l)
        vis = []
        res = []
        
        i = 0
        while( i < D ):
            m = heapq.heappop(l)
            
            if m in vis:
                continue
            
            vis.append(m)
            res.append(m)
            i = i + 1
            
            for j in range( len(ol) ):
                heapq.heappush( l, ol[j] * m )

        return res