zoukankan      html  css  js  c++  java
  • Codeforces Round #258 (Div. 2/A)/Codeforces451A_Game With Sticks

    解题报告

    http://blog.csdn.net/juncoder/article/details/38102263

    n和m跟木棍相交,问一人取一交点(必须是交点。且取完后去掉交点的两根木棍),最后谁赢

    思路:

    取最大正方形,以对角线上的交点个数推断输赢。

    #include <iostream>
    #include <cstdio>
    
    using namespace std;
    
    int main()
    {
        int m,n;
        while(cin>>n>>m)
        {
            if(n>m)
            {
                if(m%2==0)
                printf("Malvika
    ");
                else
                {
                    printf("Akshat
    ");
                }
            }
            else
            {
                if(n%2==0)
                printf("Malvika
    ");
                else
                {
                    printf("Akshat
    ");
                }
            }
        }
        return 0;
    }
    

    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 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 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.



  • 相关阅读:
    将文件放到Android模拟器的SD卡中的两种解决方法
    Response JSON数据返回
    jAVA 得到Map价值
    【动态规划】leetcode
    思考互联网分布式系统
    Cocos2d-x数据持久-变更数据
    小程序猿都找到了工作经验的方式
    抄360于Launcher浮动窗口的屏幕显示内存使用情况(改进版)
    vb.net窗口继承(房重建知识汇总)
    Spring该讲座
  • 原文地址:https://www.cnblogs.com/yxysuanfa/p/6878543.html
Copyright © 2011-2022 走看看