codeforces 451A Game With Sticks

最新推荐文章于 2023-07-12 19:20:15 发布

Wzywdj

最新推荐文章于 2023-07-12 19:20:15 发布

阅读量422

点赞数

分类专栏： codeforces刷題篇文章标签： codeforces

本文链接：https://blog.csdn.net/Wzywdj/article/details/78837255

版权

codeforces刷題篇专栏收录该内容

43 篇文章

订阅专栏

Akshat和Malvika在IOI2014赛后通过一个基于网格的游戏决定胜负。游戏涉及移除交点上的水平和垂直游戏棒，胜者为最后一个成功移除游戏棒的玩家。本文提供了一个算法解决方案来预测基于初始条件的赢家。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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 ofn 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 aren·m = 9 intersection points, numbered from1 to 9.

$\text{[math]}$

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

$\text{[math]}$

If Akshat chooses intersection point 1, then he will remove two sticks (1 - 2 and1 - 3). The resulting grid will look like this.

$\text{[math]}$

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.

AC:

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n,m;
    int sum;
    scanf("%d%d",&n,&m);
    sum=n*m;
    int t=1;
    while(t++)
    {
        sum=sum-1-n+1-m+1;
        if(n>=1)
            n--;
        if(m>=1)
            m--;
        if(sum==1||sum==0)
            break;
    }
    if(t%2)
    {
        if(sum==1)
            printf("Akshat");
        else
            printf("Malvika");
    }
    else
    {
        if(sum==1)
            printf("Malvika");
        else
            printf("Akshat");
    }
}