created divisiblesumpairs.py

chanderbhanu096 · web-flow · commit 64f8d7a7e140 · 2020-10-17T13:35:54.000+05:30
diff --git a/divisiblesumpairs.py b/divisiblesumpairs.py
@@ -0,0 +1,16 @@
+def divisibleSumPairs(n, k, ar):
+    count = 0
+    for i in range(0,n):
+        
+        # (i>j)
+        for j in range(i+1,n): 
+            if((ar[i]+ar[j])%k==0):
+                count+=1
+
+    return count
+    
+# Complete the divisibleSumPairs function in the editor below. It should return the integer count of pairs meeting the criteria.
+# divisibleSumPairs has the following parameter(s):
+# n: the integer length of array 
+# ar: an array of integers
+# k: the integer to divide the pair sum by  
