码迷,mamicode.com
首页 > 其他好文 > 详细

ACM训练二A题

时间:2014-07-29 11:54:46      阅读:300      评论:0      收藏:0      [点我收藏+]

标签:des   style   blog   http   color   os   io   2014   

这个题目很简单,虽然看上去高大上,只要找规律就行了,多看看,找找例子。-不过我花了蛮久才看出来,惭愧啊,其实就是看n.m中最小的数是奇数还是偶数。

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 nhorizontal 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.

bubuko.com,布布扣

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

Input
2 2
Output
Malvika
Input
2 3
Output
Malvika
Input
3 3
Output
Akshat

using namespace std;

int main()
{
    int n,m;
    cin >> n >> m;
    int c = n < m?n:m;
    if(c % 2 == 0)
    {
        cout << "Malvika" << endl;
    }
    else
    {
        cout << "Akshat" << endl;
    }
    return 0;
}

 

ACM训练二A题,布布扣,bubuko.com

ACM训练二A题

标签:des   style   blog   http   color   os   io   2014   

原文地址:http://www.cnblogs.com/hhhhhhhhhhhhhhhhhhhhhhhhhhh/p/3874376.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!