HDU 3863 No Gambling【博弈】

Problem Description
One day, Flyvan introduced a new game to his two friends, Oregon Maple and Grape Skin. The game is quite simple. Given an N-sized grids, like the figure A shown below (as N = 4). The blue points are the places the first player can choose, and the red points are the places the second player can choose.

In the game, the two players take turns to choose two points to get connected by a stick. The two chosen points’ distance should be exactly one-unit length. The first player’s goal is to create a ‘bridge’ that connects a most left point and a most right point. The second player’s goal is to create a ‘bridge’ that connects a most top point and a most bottom point. Figure B shows a possible result (the first player won). In addition, the stick shouldn’t get crossed.
Now Flyvan will give the number N, and his two friends will play the game. Both of the two players will choose the best strategy. You can bet on one player, and if he wins the game, you’ll get twice money you bet~
Since you are a talented programmer, you surely won’t just do gambling. Please write a program to find out the player who you should bet on. As Oregon Maple is elder, he will always play first.

Input
Each line of the input is an integer N (2 <= N <= 270000), which indicated the number Flyvan chose. The end-of-file is denoted by a single line containing the number -1.

Output
If you think the first player will win, please output “I bet on Oregon Maple~”, else please output “I bet on Grape Skin~”.

Sample Input
2
-1

Sample Output
I bet on Oregon Maple~

Source
2011 Multi-University Training Contest 3 - Host by BIT

Recommend
lcy | We have carefully selected several similar problems for you: 3861 3862 3865 3866 3868

有两个人A,B。 A想要将图片上最左边和最右边的某一个点连接形成一个桥，B想让最上和最下连。

每次只能连一段，Oregon Maple永远先手。
先手必胜。

输入N并没有什么卵用。

#include<iostream>
using namespace std;
int main()
{
    int n;
    while (cin >> n&&n != -1)
    {
        cout << "I bet on Oregon Maple~" << endl;
    }
    return 0;
}