문제 링크 : https://www.hackerrank.com/challenges/divisible-sum-pairs/problem Divisible Sum Pairs | HackerRank Count the number of pairs in an array having sums that are evenly divisible by a given number. www.hackerrank.com O(n²) 의 시간복잡도를 가진다. def divisibleSumPairs(n, k, ar): # Write your code here cnt = 0 for i in range(len(ar)): for j in range(i+1,len(ar)): if (ar[i] + ar[j]) % k == 0: cnt += 1 r..
