Competitive-Programming/CLPERM.cpp at master · fresearchgroup/Competitive-Programming · 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
#include<bits/stdc++.h>
#define gc getchar
#define pc putchar
#define maxm 100005
#define si(n) scanf("%d",&n)
#define sc(c) scanf("%c",&c)
#define sll(n) scanf("%lld",&n)
#define print(n) printf("%d",n)
#define printll(n) printf("%lld",n)
#define loop(i,j,n) for(int(i)=(j);(i)<(n);++(i))
#define rep(i,n) for(int(i)=0;(i)<(n);++(i))
#define ll long long
#define vi vector<int>
#define vii vector< pair<int,int> >
#define pii pair<int,int>
#define sz(x) (int)x.size()
#define pn pc('\n')
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define all(x) x.begin(),x.end()

using namespace std;

int n,k;
vi v,w;
void read()
{
    v.clear();
    w.clear();
    cin >> n >> k;
    rep(i,k)
    {
        int x;
        cin >> x;
        w.pb(x);
    }
    loop(i,1,n+1)
        v.pb(i);
}

void solve()
{
    if(k == 0)
    {
        ll int sum = (n*(n+1))/2;
        sum++;
        if(sum%2)
            cout << "Chef" << endl;
        else
            cout << "Mom" << endl;
        return;
    }
    for(int i = 0;i<sz(w);++i)
    {
        for(int j = 0;j<sz(v);++j)
        {
            if(v[j] == w[i])
            {
                v[j] = 0;
                break;
            }
        }
    }
    int res = 1;
    for(int i = 0;i<sz(v) && v[i] <= res;++i)
    {
        if(v[i] == 0)
            continue;
        res += v[i];
    }
    if(res%2)
        cout << "Chef" << endl;
    else
        cout << "Mom" << endl;
}

int main()
{
    ios_base::sync_with_stdio(false);
    int t;
    cin >> t;
    while(t--)
    {
        read();
        solve();
    }
    return 0;
}