human
Largest divisible pairs subset | ''function to find the longest Subsequence.
dp [ i ] is going to store size of largest divisible subset beginning with a [ i ] ..
Since last element is largest , d [ n - 1 ] is 1.
Fill values for smaller elements.
Find all multiples of a [ i ] and consider the multiple that has largest subset beginning with it ..
Return maximum value from dp [ ].
Driver Code"
How can the above be solved in Python?
assistant
#Here is code to largest divisible pairs subset and the other steps required.
 def largestSubset ( a , n ) :
	dp = [ 0 for i in range ( n ) ]
	dp [ n - 1 ] = 1 ;
	for i in range ( n - 2 , - 1 , - 1 ) :
		mxm = 0 ;
		for j in range ( i + 1 , n ) :
			if a [ j ] % a [ i ] == 0 or a [ i ] % a [ j ] == 0 :
				mxm = max ( mxm , dp [ j ] )
		dp [ i ] = 1 + mxm
	return max ( dp )
a = [ 1 , 3 , 6 , 13 , 17 , 18 ]
n = len ( a )
print ( largestSubset ( a , n ) )