CF959A Mahmoud and Ehab and the even-odd game

2024-05-05 07:32:24

原题链接：http://codeforces.com/contest/959/problem/A

Mahmoud and Ehab and the even-odd game

Mahmoud and Ehab play a game called the even-odd game. Ehab chooses his favorite integer n and then they take turns, starting from Mahmoud. In each player’s turn, he has to choose an integer a and subtract it from n such that:

1 ≤ a ≤ n.1≤a≤n.1 ≤ a ≤ n.
If it’s Mahmoud’s turn, aaa has to be even, but if it’s Ehab’s turn, a" role="presentation" style="position: relative;">aaa has to be odd.

If the current player can’t choose any number satisfying the conditions, he loses. Can you determine the winner if they both play optimally?

Input

The only line contains an integer n(1 ≤ n ≤ 109)n(1≤n≤109)n (1 ≤ n ≤ 10^9), the number at the beginning of the game.

Output

Output “Mahmoud” (without quotes) if Mahmoud wins and “Ehab” (without quotes) otherwise.

Examples

input

1

output

Ehab

input

2

output

Mahmoud

Note

In the first sample, Mahmoud can’t choose any integer a initially because there is no positive even integer less than or equal to 1 so Ehab wins.

In the second sample, Mahmoud has to choose a = 2 and subtract it from n. It’s Ehab’s turn and n = 0. There is no positive odd integer less than or equal to 0 so Mahmoud wins.

题解

如果nnn为偶数，Mahmoud" role="presentation" style="position: relative;">MahmoudMahmoudMahmoud直接拿完；否则MahmoudMahmoudMahmoud拿完后必定剩下一个奇数。

代码

#include<bits/stdc++.h>
using namespace std;
int n;
void in(){scanf("%d",&n);}
void ac(){n&1?puts("Ehab"):puts("Mahmoud");}
int main(){in();ac();}

CF959A Mahmoud and Ehab and the even-odd game相关推荐

Codeforces 862B - Mahmoud and Ehab and the bipartiteness
862B - Mahmoud and Ehab and the bipartiteness 思路:先染色,然后找一种颜色dfs遍历每一个点求答案. 代码: #include<bits/stdc+ ...
Codeforces.959E.Mahmoud and Ehab and the xor-MST(思路)
题目链接 \(Description\) 有一张\(n\)个点的完全图,从\(0\)到\(n-1\)标号,每两点\(i,j\)间的边权为\(i\oplus j\).求其最小生成树边权之和. \(Sol ...
Codeforces 959 E. Mahmoud and Ehab and the xor-MST 思路：找规律题，时间复杂度O(log(n))
题目: 解题思路这题就是0,1,2-n-1总共n个数字形成的最小生成树. 我们可以发现,一个数字k与比它小的数字形成的异或值,一定可以取到k与所有正整数形成的异或值的最小值. 要计算n个数字的情况我 ...
D. Mahmoud and Ehab and the binary string Codeforces Round #435 (Div. 2)
http://codeforces.com/contest/862/problem/D 交互题 fflush(stdout) 调试: 先行给出结果,函数代替输入 1 #include <cstd ...
Codeforces 862D. Mahmoud and Ehab and the binary string 【二分】(交互)
<题目链接> 题目大意: 有一个长度为n(n<1000)的01串,该串中至少有一个0和一个1,现在由你构造出一些01串,进行询问,然后系统会给出你构造的串与原串的 Hamming ...
E. Mahmoud and Ehab and the function Codeforces Round #435 (Div. 2)
http://codeforces.com/contest/862/problem/E 二分答案一个数与数组中的哪个数最接近: 先对数组中的数排序,然后lower_bound 1 #include ...
codeforce 766D Mahmoud and a Dictionary 带权并查集
传送门 D. Mahmoud and a Dictionary time limit per test 4 seconds memory limit per test 256 megabytes in ...
Codeforces 题目合集+分类+代码【Updating...】【361 in total】
961A - Tetris 模拟 ...
【codeforces】【比赛题解】#862 CF Round #435 (Div.2)
这次比赛打得很舒服,莫名得了个Rank41,涨了219的Rating,就比较优秀.不过还是没有闫神厉害啊. 题目链接::P. [A]MEX 题意: Evil博士把Mahmoud和Ehab绑架到了邪恶之 ...
Ehab Is an Odd Person
https://codeforces.com/contest/1174/problem/B 题解:排序+思维如果同时存在奇数偶数就排序 /* *@Author: STZG *@Language: C ...

最新文章

热门文章