Divisible Sum Pairs

1. 문제

2. 알고리즘

키워드 - 구현

3. 코드

#include <bits/stdc++.h>
 
using namespace std;
 
int divisibleSumPairs(int n, int k, vector <int> ar) {
    // Complete this function
    
    const int size = ar.size();
    int sol = 0;
    
    for(int i =0; i<size; i++) {
        for(int j=i+1; j<size; j++) {
            int cand = ar[i] + ar[j];
            
            // can divisible by k
            if (cand % k == 0) {
                sol++;
            }
        }
    }
    return sol;
}
 
int main() {
    int n;
    int k;
    cin >> n >> k;
    vector<int> ar(n);
    for(int ar_i = 0; ar_i < n; ar_i++){
       cin >> ar[ar_i];
    }
    int result = divisibleSumPairs(n, k, ar);
    cout << result << endl;
    return 0;
}