-
Notifications
You must be signed in to change notification settings - Fork 0
/
Chef and Coins Game.cpp
120 lines (98 loc) · 2.11 KB
/
Chef and Coins Game.cpp
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
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
/*
RAJAT SINGH
VIT VELLORE
*/
#include<bits/stdc++.h>
using namespace std;
#define ll long long
//#define max 706000
#define gc getchar_unlocked
#define pc putchar_unlocked
//inline void get(int *p){register int n=0,sign=1,a=gc();while(a<'0'||a>'9'){ if(a=='-'){sign=-1;a=gc();break;} a=gc();}while(a>='0' && a<='9'){n=(n<<1)+(n<<3)+a-'0';a=gc();}*p=n*sign;}
//inline void put(int n){char d[10];int i=0;if(n<0){pc('-');n=-n;}do{d[i++]=n%10+'0';n=n/10;}while(n);while(i)pc(d[--i]);pc('\n');}
#define sc(a) scanf("%d",&a)
# define ll long long
#define p(a) printf("%d\n",a)
#define l(i,a) for(int i=0;i<a;i++)
#define re(j,a,b) for(ll int j=a;j<=b;j++)
#define modu 1000000007
ll modular_pow(ll base, ll exponent)
{
ll result = 1;
while (exponent > 0)
{
if (exponent % 2 == 1)
result = (result * base) % modu;
exponent = exponent >> 1;
base = (base * base) % modu;
}
return result;
}
int gcd(int a,int b){
if(b==0)
return a;//gcd
else return gcd(b,a%b);
}
bool chek(int x){
return (x&&!(x&(x-1)));// power of 2
}
int onebits(int n){
return __builtin_popcount(n);//count number od set bits in a number
}
ll max(ll x, ll y){
if(x>=y) return x;
else return y;
}
string s;
void swap(char *x, char *y){
char t;
t= *x;
*x= *y;
*y=t;
}
int c=0;
void pr(int st, int e){
if(st==e){
cout<<s<<endl;
}
else re(i,st,e){
swap(&s[i],&s[st]);
pr(st+1,e);
swap(&s[i],&s[st]);
}
}
ll POW(ll x,ll y){
ll ans=1;
for(ll i=1;i<=y;i++) ans*=x;
return ans;
}
vector< ll >v;
int main() {
// freopen("inp.txt", "r", stdin);
int t;
sc(t);
while(t--){
ll n; cin>>n;
//n=6;
if(n<=5) puts("Chef");
else{
// re(i,1,10){
// n=i;
/* set< ll >s;
for(int u=2;u*u <=n;u++){
if(n%u==0){
s.insert(u);
while(n%u==0) n/=u;
}
if(n<2) break;
}
if(n>1) s.insert(n);*/
if(n%6==0) puts("Misha");
else{
puts("Chef");
}
//cout<< s.size()<<endl;}
}
}
return 0;
}