human
Count of distinct pair sum between two 1 to N value Arrays | Function to find the distinct sums.
Set to store distinct sums.
Inserting every sum.
Returning distinct sums.
Driver code"
How can the above be solved in Python?
assistant
#Here is code to count of distinct pair sum between two 1 to N value Arrays and the other steps required.
 def findDistinctSums ( n ) :
	s = set ( )
	for i in range ( 1 , n + 1 ) :
		for j in range ( i , n + 1 ) :
			s . add ( i + j )
	return len ( s )
N = 3
print ( findDistinctSums ( N ) )