HDU3863:No Gambling

本文描述了一种基于网格的游戏策略,玩家目标是在网格上通过连接点形成‘桥接’,以实现特定目标。游戏在N大小的网格上进行,两名玩家交替选择连接点,最终胜利者取决于谁能成功创建其目标桥接。文章提供了代码示例,展示如何确定先手玩家在正确策略下的胜率。
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~


 

第一个人从左到右连接蓝点

第二个人从上到下连接红点

轮流进行

看最后谁的线最多则赢

我们可以发现,只要是先手,那么连的线一定是最多了,因此代码也就只有短短的几行

 

#include <stdio.h>
int main()
{
    int n;
    while(scanf("%d",&n),n+1)
    puts("I bet on Oregon Maple~");
    return 0;
}


 

 

 

 

转载于:https://www.cnblogs.com/riasky/p/3481845.html

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值