We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
def divisibleSumPairs(n, k, ar):
count=0
for i in range(len(ar)-1):
first=ar[i]
for j in range(i+1,len(ar)):
second=ar[j]
if (first+second)%k==0:
count +=1
return count
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Divisible Sum Pairs
You are viewing a single comment's thread. Return to all comments →
def divisibleSumPairs(n, k, ar): count=0 for i in range(len(ar)-1): first=ar[i] for j in range(i+1,len(ar)): second=ar[j] if (first+second)%k==0: count +=1 return count