"Analog" "Codeforces" 451A Game with sticks

http://acm.hust.edu.cn/vjudge/problem/viewProblem.action?id=52106

Now there are n poles, a stick of M root, crossing out N*m intersection.

Two players take turns selecting one from the existing intersection and removing the stick attached to the intersection

When a player does not have a stick to remove, another player wins

The key to winning is to make the other party without sticks, or the other side of the stick only horizontal or vertical sticks, so that there is no intersection can be selected.

In the beginning, each person chooses a point, is to remove a horizontal vertical, when the removal of a direction all the sticks, won.

1#include <bits/stdc++.h>2 using namespacestd;3 4 intMain () {5     intN, M;6      while(~SCANF ("%d%d", &n, &m)) {7         inttemp =min (n, m);8Temp-=1;9         if(temp%2==0) puts ("Akshat");Ten         ElsePuts"Malvika"); One     } A     return 0; -}

"Analog" "Codeforces" 451A Game with sticks