Skip to content

Added divisiblesumpairs.py for the #HacktoberFest2020 #695

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Closed
chanderbhanu096 wants to merge 1 commit into from
Closed

Added divisiblesumpairs.py for the #HacktoberFest2020 #695

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
16 changes: 16 additions & 0 deletions divisiblesumpairs.py
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -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