codeforces/1883C.cpp at main · Nithin0306/codeforces · 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
#include <bits/stdc++.h>
using namespace std;

#define fast_io ios::sync_with_stdio(false); cin.tie(nullptr);

int main() {
    fast_io;

    long long  t;
    cin >> t;
    while (t--) {
        // solve here
        long long n, k;
		cin >> n >> k;
		vector<long long> a(n);
		for (long long i = 0; i < n; i++)
			cin >> a[i];

		long long ans = INT_MAX;
		long long even_count = 0;
		for (long long i = 0; i < n; i++)
		{
			if (a[i] % 2 == 0)
				even_count++;
			if (a[i] % k == 0)
				ans = 0;
			ans = min(ans, (k - a[i] % k));
		}


		if (k == 4)
		{
			if (even_count >= 2)
				ans = min(ans, 0LL);
			else if (even_count == 1)
				ans = min(ans, 1LL);
			else if (even_count == 0)
				ans = min(ans, 2LL);
		}
		cout << ans << endl;

    }

    return 0;
}