human
Count all subsequences having product less than K | Function to count numbers of such subsequences having product less than k ..
number of subsequence using j - 1 terms.
if arr [ j - 1 ] > i it will surely make product greater thus it won 't contribute then.
number of subsequence using 1 to j - 1 terms and j - th term.
Driver code"
How can the above be solved in Python?
 ... Give me a code to count all subsequences having product less than K and the other steps required?
assistant
#Here is code to count all subsequences having product less than K and the other steps required.
 def productSubSeqCount ( arr , k ) :
	n = len ( arr )
	dp = [ [ 0 for i in range ( n + 1 ) ] for j in range ( k + 1 ) ]
	for i in range ( 1 , k + 1 ) :
		for j in range ( 1 , n + 1 ) :
			dp [ i ] [ j ] = dp [ i ] [ j - 1 ]
			if arr [ j - 1 ] <= i and arr [ j - 1 ] > 0 :
				dp [ i ] [ j ] += dp [ i // arr [ j - 1 ] ] [ j - 1 ] + 1
	return dp [ k ] [ n ]
A = [ 1 , 2 , 3 , 4 ]
k = 10
print ( productSubSeqCount ( A , k ) )