human
Sequence with sum K and minimum sum of absolute differences between consecutive elements | Function to return the minimized sum.
If k is divisible by n then the answer will be 0.
Else the answer will be 1.
Driver code"
How can the above be solved in Python?
assistant
#Here is code to sequence with sum K and minimum sum of absolute differences between consecutive elements and the other steps required.
 def minimum_sum ( n , k ) :
	if ( k % n == 0 ) :
		return 0 ;
	return 1
n = 3
k = 56
print ( minimum_sum ( n , k ) )