zoukankan      html  css  js  c++  java
  • acm集训训练赛A题【签到题】

    一、题目

    Description

    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 nhorizontal 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 Input

    Input
    2 2
    Output
    Malvika
    Input
    2 3
    Output
    Malvika
    Input
    3 3
    Output
    Akshat

    Hint

    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.

    二、题目源程序

    #include <iostream>
    #include<math.h>
    
    using namespace std;
    
    int min(int x,int y)
    {
        return (x>y? y:x);
    }
    int main()
    {
        int n,m;
        cin>>n>>m;
        cout<<(min(n,m)%2==0? "Malvika":"Akshat");
    }

    三、解题思路

    这道题比较水,主要是了解到模2是否等于0就可以了。

  • 相关阅读:
    【Codeforces】【161Div2】
    【ZOJ月赛】【树形DP】【I.Destroy】
    【Baltic 2001远程通信】
    【树形DP】【分组背包】【HDU1561】
    【差分约束系统】【仍未AC】【Asia Harbin 2010/2011】【THE MATRIX PROBLEM】
    【DP】【2012 ACM/ICPC 成都赛区现场赛】【I.Count】
    【ZOJ月赛】【二分查找】【A.Edward's Cola Plan】
    【DP】【单调队列多重背包】
    【树形依赖背包】
    SQL 格式
  • 原文地址:https://www.cnblogs.com/fightfor/p/3871506.html
Copyright © 2011-2022 走看看