codeforces 258 A Game With Sticks(水题)
来源:互联网 发布:美工简历怎么写 编辑:程序博客网 时间:2024/06/13 02:38
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.
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?
The first line of input contains two space-separated integers, n and m (1 ≤ n, m ≤ 100).
Print a single line containing "Akshat" or "Malvika" (without the quotes), depending on the winner of the game.
2 2
Malvika
2 3
Malvika
3 3
Akshat
Explanation of the first sample:
The grid has four intersection points, numbered from 1 to4.
If Akshat chooses intersection point 1, then he will remove two sticks (1 - 2 and1 - 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.
题目看似高大上,其实相当水,只要n,m中最小的数是偶数则 Malvika赢,否则Akshat赢
代码:
#include <iostream>using namespace std;int main(){ int n,m; while(cin>>n>>m) { cout<<((min(n,m)%2==0)?"Malvika":"Akshat")<<endl; } return 0;}
- codeforces 258 A Game With Sticks(水题)
- Codeforces 451A Game With Sticks(水题)
- Codeforces #258 (Div. 2) A. Game With Sticks
- Codeforces Round #258 (Div. 2)1A Game With Sticks
- Codeforces Div. 2 #258-A. Game With Sticks
- Codeforces Round #258 (Div. 2) A. Game With Sticks
- Codeforces 451A Game With Sticks
- Codeforces 451A Game With Sticks
- Codeforces 451 A . Game With Sticks
- codeforces 451A Game With Sticks
- A. Game With Sticks
- A. Game With Sticks
- Game With Sticks codeforces +水题==
- CF 258A. Game With Sticks
- [Codeforces 451A] Game With Sticks (博弈)
- Codeforces Round #258 (Div. 2) A. Game With Sticks(数学题)
- 451 A. Game With Sticks
- 451A - Game With Sticks
- 9.3 Surrounded Regions
- 而洗洁精膜会有效地保持玻璃2小时内不结霜
- 黑马程序员_枚举
- 类型转换
- 微信来了,云盘和云计算服务器也来了
- codeforces 258 A Game With Sticks(水题)
- csdn夏令营week2
- 在引入项目时,如何更改android工程名
- Codeforces Round #258 (Div. 2)
- 主(数据)类型的重载
- Pow(x, n)
- 互联网思维
- 如何将android例子程序添加到Eclipse进行调试运行
- 跟我学设计模式视频教程——抽象工厂,建造者