geeksForGeeksSolutions/arrayPairSumDivisibilityProblem.cpp at master · kk77777/geeksForGeeksSolutions · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
#include <bits/stdc++.h>
using namespace std;

bool f(vector<int> v, int k)
{
    unordered_map<int, int> m;
    for (int i = 0; i < v.size(); i++)
    {
        m[v[i] % k]++;
    }
    for (int i = 0; i < v.size(); i++)
    {
        int rem = v[i] % k;
        if (2 * rem == k)
        {
            if (m[rem] % 2 != 0)
            {
                return false;
            }
        }
        else if (rem == 0)
        {
            if (m[rem] % 2 != 0)
            {
                return false;
            }
        }
        else
        {
            if (m[rem] != m[k - rem])
            {
                return false;
            }
        }
    }
    return true;
}

int main()
{
    int tc;
    cin >> tc;
    while (tc--)
    {
        int n;
        cin >> n;
        vector<int> v;
        for (int i = 0; i < n; i++)
        {
            int x;
            cin >> x;
            v.push_back(x);
        }
        int k;
        cin >> k;
        f(v, k) ? cout << "True\n" : cout << "False\n";
    }
}