Code forces #258 div2 A.Game With Sticks
2014-07-25 15:08
393 查看
A. Game With Sticks
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
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 test(s)
Input
Output
Input
Output
Input
Output
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.
其实这题是大水题,听说昨晚4题全是大水题,11.30这时间真害死人~~~~
这题主要是说两个大犇分别叫Akshat(一开始我还以为叫AK Shot)和Malvika,玩一个游戏,从n,m跟棒子组成的图中取交叉点。由于Akshat是冠军,所以他先取。
谁最后没得取,谁就输,求最后谁赢了。只要找出n,m的最小值mod2就行了。
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
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 test(s)
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.
其实这题是大水题,听说昨晚4题全是大水题,11.30这时间真害死人~~~~
这题主要是说两个大犇分别叫Akshat(一开始我还以为叫AK Shot)和Malvika,玩一个游戏,从n,m跟棒子组成的图中取交叉点。由于Akshat是冠军,所以他先取。
谁最后没得取,谁就输,求最后谁赢了。只要找出n,m的最小值mod2就行了。
include<iostream> using namespace std; int main() { int a,b,c; cin>>a>>b; c=min(a,b); if (c%2==1) cout<<"Akshat"<<endl; else cout<<"Malvika"<<endl; }
相关文章推荐
- Codeforces Div. 2 #258-A. Game With Sticks
- Codeforces Round #258 (Div. 2) A. Game With Sticks(数学题)
- Codeforces Round #188 (Div. 1) Game with Powers 引发的联想 NIM游戏 Sprague Grundy Theory
- Codeforces Round #468 (Div. 2, based on Technocup 2018 Final Round)E. Game with String(枚举)
- Codeforces Round #258 (Div. 2) C. Predict Outcome of the Game
- 【Codeforces Round 275 (Div 2)E】【状压DP 概率DP求期望 线性相加思想 二进制系统函数】Game with Strings n个串目标串随机猜位置随机的猜出答案的期望步
- Codeforces Round #432 (Div. 2) (Codeforces 850C) E. Arpa and a game with Mojtaba 博弈+状态压缩
- Codeforces Round #426 (Div. 2) B.The Festive Evening+C.The Meaningless Game
- Codeforces Round #297 (Div. 2) C - Ilya and Sticks
- Codeforces Round #304 (Div. 2) D - Soldier and Number Game
- Codeforces Round #304 (Div. 2) D. Soldier and Number Game 数论 筛表法
- Codeforces Round #280 (Div. 2) D. Vanya and Computer Game 数学+预处理
- Codeforces Round #258 (Div. 2/A)/Codeforces451A_Game With Sticks
- Codeforces Round #426 (Div. 2)The Meaningless Game(思维+二分)
- Codeforces Round #269 (Div. 2) A. MUH and Sticks
- Codeforces Round #426 (Div. 2) B.The Festive Evening+C.The Meaningless Game
- Codeforces Round #426 (Div. 2) C - The Meaningless Game
- Codeforces Round #397(Div. 1 + Div. 2 combined)C. Table Tennis Game 2【贪心】
- 【 Codeforces Round #430 (Div. 2) A 】 Kirill And The Game
- Codeforces Round #317 [AimFund Thanks-Round] (Div. 2) C Lengthening Sticks(组合+容斥)