zoukankan      html  css  js  c++  java
  • HDU-3863 No Gambling

                 http://acm.hdu.edu.cn/showproblem.php?pid=3863

                        No Gambling

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65568/32768 K (Java/Others)
    Total Submission(s): 1280    Accepted Submission(s): 886


    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<iostream>
    #include<cstdio>
    using namespace std;
    int main()
    {
        int n;
      while(~scanf("%d",&n))
      {
          if(n==-1)
             break;
          else
             printf("I bet on Oregon Maple~
    ");
      }
      return 0;
    }
  • 相关阅读:
    dinic模板
    匈牙利算法(codevs2776)
    线段树(codevs1082)
    KM模板
    kmp模板,线性完成pos
    (一)Python入门-2编程基本概念:03引用的本质-栈内存和堆内存-内存示意图
    (一)Python入门-2编程基本概念:04标识符-帮助系统简单实用-命名规则
    (一)Python入门-2编程基本概念:05变量的声明-初始化-删除变量-垃圾回收机制
    (一)Python入门-2编程基本概念:06链式赋值-系列解包赋值-常量
    (一)Python入门:05Python程序格式-缩进-行注释-段注释
  • 原文地址:https://www.cnblogs.com/cancangood/p/3906508.html
Copyright © 2011-2022 走看看