Codeforces 451A
来源:互联网 发布:竞优软件 编辑:程序博客网 时间:2024/05/22 18:23
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
这题比较简单的,估计主要的难度是在看题上。只要看懂题目,还是挺好做的。
#include <cstdio>int main(){ int a,b; scanf("%d%d",&a,&b); a = a < b ? a : b; printf(a&1 ? "Akshat" : "Malvika"); return 0;}
- Codeforces 451A
- CodeForces-a
- Codeforces 903A A
- Codeforces 451A Game With Sticks
- Codeforces 451A Game With Sticks(水题)
- Codeforces 451A Game With Sticks
- Codeforces 451 A . Game With Sticks
- Codeforces Round #451 (Div. 2) A. Rounding
- Codeforces Round #451 (Div. 2) a
- Codeforces Round #451 (Div. 2) A-B
- Codeforces Round #451 (Div. 2) A
- codeforces 451A Game With Sticks
- CodeForces 18A A - Triangle
- CodeForces 133A A. HQ9+
- codeforces 651A A. Joysticks
- 【Codeforces 597A】A. Divisibility
- 【 Codeforces 615A】A. Bulbs
- A. Divisibility CodeForces 597A
- hdu 2401 Baskets of Gold Coins
- virtual base class的问题
- ExecutorService.invokeAny()和ExecutorService.invokeAll()的使用剖析
- 在Ubuntu 14.04 64bit上编译安装Crtmpserver trunk svn 811版本!
- @synthesize obj=_obj的意义详解 @property和@synthesize
- Codeforces 451A
- Hadoop集群管理之内存管理
- ORM之硬伤
- 小学一下volatile和sig_atomic_t类型.
- HDU1166 敌兵布阵
- Truck History - POJ 1789 最小生成树
- Android项目工程目录详解
- 字典树小结
- JavaLearing : 链表