[알고리즘] 17. Divisivle Sum Pairs

You are given an array of  integers, , and a positive integer, . Find and print the number of  pairs where  and  +  is divisible by .

For example,  and . Our three pairs meeting the criteria are  and .

Function Description

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

Input Format

The first line contains  space-separated integers,  and .
The second line contains  space-separated integers describing the values of .

Constraints

Output Format

Print the number of  pairs where  and  +  is evenly divisible by .

Sample Input

6 3
1 3 2 6 1 2

Sample Output

 5

Explanation

Here are the  valid pairs when :

답 : 

#!/bin/python3

import math

import os

import random

import re

import sys

# Complete the divisibleSumPairs function below.

def divisibleSumPairs(n, k, ar):

count=0

for i in range(1,len(ar)):

new_ar = ar[i:len(ar)]

for j in range(len(new_ar)):

if (ar[i-1] + new_ar[j])%k ==0:

count+=1

return count

if __name__ == '__main__':

fptr = open(os.environ['OUTPUT_PATH'], 'w')

nk = input().split()

n = int(nk[0])

k = int(nk[1])

ar = list(map(int, input().rstrip().split()))

result = divisibleSumPairs(n, k, ar)

fptr.write(str(result) + '\n')

fptr.close()

앞의 자리의 숫자를 고정시켜놓고 하나하나 더해가며 나머지를 확인하는 문제였다!