CodeForces/1883C.cpp at main · lolshark99/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
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
#include<bits/stdc++.h>
using namespace std;
void solver(){
    int n;
    cin>>n;
    vector<int>nums(n);
    int k;
    cin>>k;
    bool flag4 ;
    for(int i = 0 ; i < n ; i++){
        cin>>nums[i];
    }
    if(k == 2){
        int best = INT_MAX;
        for(int j = 0 ; j < n ;j++){
            if(nums[j] % 2 == 0){
                best = min(best , 0);
            }
            else{
                best = min(best ,1);
            }
        }
        cout<<best<<endl;
    }
    else if(k == 3){
        int best = INT_MAX;
        for(int j = 0 ; j < n ; j++){
            int a = nums[j]%3 ;
            if(a == 0){
                best = 0;
                break;
            }
            else if(a == 1){
                best = min(best , 2);
            }
            else{
                best = min(best , 1);
            }
        }
        cout<<best<<endl;
    }
    else if (k == 4) {
    int eve_count = 0;
    bool has4 = false;
    for (int j = 0; j < n; j++) {
        if (nums[j] % 4 == 0) {
            has4 = true;
            break;
        }
        if (nums[j] % 2 == 0) {
            eve_count++;
        }
    }
    if (has4 || eve_count >= 2) {
        cout << 0 << endl;
        return;
    }
    int best4 = INT_MAX;
    for (int j = 0; j < n; j++) {
        int add = (4 - nums[j] % 4) % 4;
        best4 = min(best4, add);
    }
    int best2 = max(0, 2 - eve_count);
    cout << min(best4, best2) << endl;
    }
    else{
        int best = INT_MAX;
        for(int j = 0 ; j < n ;j++){
            int a = nums[j] % 5;
            if(a == 0){
                best = 0;
                break;
            }
            else if(a == 1){
                best = min(best , 4);
            }
            else if(a == 2){
                best = min(best , 3);
            }
            else if(a == 3){
                best = min(best , 2);
            }
            else if(a == 4){
                best = min(best , 1);
            }
        }
        cout<<best<<endl;
    }
}
int main(){
    int t;
    cin>>t;
    while(t--){
        solver();
    }
}