Codeforces Round #258 (Div. 2) A. Game With Sticks 水题

A. Game With Sticks

题目连接：

http://codeforces.com/contest/451/problem/A

Description

After winning gold and silver in IOI 2014, Akshat and Malvika want to have some fun. Now they are playing a game on a grid made of n horizontal and m vertical sticks.

An intersection point is any point on the grid which is formed by the intersection of one horizontal stick and one vertical stick.

In the grid shown below, n = 3 and m = 3. There are n + m = 6 sticks in total (horizontal sticks are shown in red and vertical sticks are shown in green). There are n·m = 9 intersection points, numbered from 1 to 9.

The rules of the game are very simple. The players move in turns. Akshat won gold, so he makes the first move. During his/her move, a player must choose any remaining intersection point and remove from the grid all sticks which pass through this point. A player will lose the game if he/she cannot make a move (i.e. there are no intersection points remaining on the grid at his/her move).

Assume that both players play optimally. Who will win the game?

Input

The first line of input contains two space-separated integers, n and m (1 ≤ n, m ≤ 100).

Output

Print a single line containing "Akshat" or "Malvika" (without the quotes), depending on the winner of the game.

Sample Input

2 2

Sample Output

Malvika1

Hint

题意

有n根横着的筷子，m根竖着的筷子，会相交出nm个交点，然后现在两个人依次玩这个游戏，每次这个人选择一个点，然后就会把穿过这个点的筷子都拿掉。

哪个人不能操作的时候，就判断这个人输掉了。

问最后谁会胜利。

题解：

取min之后，判断奇偶性就好了~

代码

#include<bits/stdc++.h>
using namespace std;

int main()
{
    int n,m;
    scanf("%d%d",&n,&m);
    n=min(n,m);
    if(n%2)printf("Akshat\n");
    else printf("Malvika\n");
}