HDU 3863 No Gambling【博弈】
来源:互联网 发布:java获取系统当前时间 编辑:程序博客网 时间:2024/06/03 12:05
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;}
- HDU 3863 No Gambling【博弈】
- HDU 3863 No Gambling 简单博弈
- HDU 3863 No Gambling(博弈)
- hdu 3863 No Gambling (水博弈规律)
- hdu 3869 No Gambling 博弈
- No Gambling - HUD 3863 博弈
- hdoj 3863 No Gambling 【博弈】
- 【hdu 3863】No Gambling
- hdu 3863 No Gambling
- HDU 3863 No Gambling 题解
- No Gambling----对偶博弈
- HDOJ 题目1269No Gambling(博弈)
- HDU 3863 No Gambling (博弈论、对称性、水)
- hdu3863——No Gambling(简单博弈)
- 2011 Multi-University Training Contest 3 - Host by BIT No Gambling 也就是hdu 3863
- NYOJ 341 No Gambling
- hdu3863 No Gambling
- HDU3863:No Gambling
- 【Java】关于路径.和..以及/的说明
- 颜色的编码
- WEB开发中,使用JSON-RPC好,还是RESTful API好?
- 汇编关机代码
- redis 单机版安装配置
- HDU 3863 No Gambling【博弈】
- Java反射与内部类复习总结
- Ajax的回顾
- io
- 卷积神经网络——Network In Network
- 解决Android Studio打包生成apk装到手机后闪退
- 二叉树与二叉查找树
- IntelliJ IDEA中搭建SpringMVC环境
- JAVA学习笔记2--数据类型