CodeForces/Raspberries.cpp at main · codeAntariksh/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
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
const int MOD = 1e9 + 7;

void solve(vector<int> &arr,int k)
{
	int n = arr.size();
	vector<int> hash(n);
	for(int i=0;i<n;i++)
	{
		hash[i] = arr[i]%k;
		if(hash[i]==0)
		{
			cout<<0<<endl;
			return;
		}
	}
	if(k==2)
	{
		cout<<1<<endl;
		return;
	}
	if(k==4)
	{
		int even=0;
		for(auto &x:hash)
		{
			if(x%2==0) even++;
			if(even==2)
			{
				cout<<0<<endl;
				return;
			}
		}
		if(even==1)
		{
			cout<<1<<endl;
			return;
		}
		else
		{
			for(auto &x:hash)
			{
				if(x==3)
				{
					cout<<1<<endl;
					return;
				}
			}
			cout<<2<<endl;
			return;
		}
	}
	int maximum = *max_element(hash.begin(),hash.end());
	cout<<k-maximum<<endl;
	return;
}

int32_t main()
{
	ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
	int t=1;
	cin>>t;
	while(t--)
	{
		int n;
		int k;
		cin>>n>>k;
		vector<int> arr(n);
		for (auto &a:arr)
			cin>>a;
		solve(arr,k);
	}
	return 0;
}