codeforces 451A Game With Sticks
来源:互联网 发布:js 代码高亮插件 编辑:程序博客网 时间:2024/05/29 04:47
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 andm 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.
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");
}
}
还有一种想法,就是看m和n中较小的哪一个
- Codeforces 451A Game With Sticks
- Codeforces 451A Game With Sticks(水题)
- Codeforces 451A Game With Sticks
- Codeforces 451 A . Game With Sticks
- codeforces 451A Game With Sticks
- [Codeforces 451A] Game With Sticks (博弈)
- codeforces 258 A Game With Sticks(水题)
- 451 A. Game With Sticks
- 451A - Game With Sticks
- A. Game With Sticks
- A. 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
- Game With Sticks codeforces +水题==
- CF 258A. Game With Sticks
- Codeforces Round #258 (Div. 2) A. Game With Sticks(数学题)
- 队列数组学习(不使用malloc)
- Hinton《面向机器学习的神经网络》中文版 视频教程
- SVM支持向量机模型
- Codeforces Round #449 (Div. 2)
- Python学习之基本数据类型(一)
- codeforces 451A Game With Sticks
- 通过枚举类对if-else的改造
- java详解 --- 集合之数组实现和链表实现
- 从Activity往Fragment传值
- 图片压缩
- JumpPointSearchPlus with GoalBounding 学习笔记2
- POJ 2312 Battle City
- 深度学习之RBM
- Pull Request 的概述