acm寒假特辑1月19日 CodeForces - 451A

最新推荐文章于 2021-05-21 00:53:55 发布

Gidear

最新推荐文章于 2021-05-21 00:53:55 发布

阅读量207

点赞数

分类专栏： 2019acm寒假特辑

本文链接：https://blog.csdn.net/weixin_43975504/article/details/86674274

版权

2019acm寒假特辑专栏收录该内容

18 篇文章 0 订阅

订阅专栏

C - 3 CodeForces - 451A

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.

Examples
Input
2 2
Output
Malvika
Input
2 3
Output
Malvika
Input
3 3
Output
Akshat
Note
Explanation of the first sample:

在这里插入图片描述
The grid has four intersection points, numbered from 1 to 4.

If Akshat chooses intersection point 1, then he will remove two sticks (1 - 2 and 1 - 3). The resulting grid will look like this.
在这里插入图片描述

Now there is only one remaining intersection point (i.e. 4). Malvika must choose it and remove both remaining sticks. After her move the grid will be empty.

In the empty grid, Akshat cannot make any move, hence he will lose.

Since all 4 intersection points of the grid are equivalent, Akshat will lose no matter which one he picks.

这种题表面上很唬人，实际上理解题意看图找规律，你来我往的游戏，最后看最小的边是奇偶则可判断。

#include<iostream>
using namespace std;
int main()
{
	int n, m, min;
	cin >> n >> m;
	if (n >= m)
		min = m;
	else
		min = n;
	if (min % 2)
		cout << "Akshat" << endl;
	else
		cout << "Malvika" << endl;
    return 0;
}