zoukankan      html  css  js  c++  java
  • HDU6312 Game (多校第二场1004) 简单博弈

    Game

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
    Total Submission(s): 1340    Accepted Submission(s): 891


    Problem Description
    Alice and Bob are playing a game.
    The game is played on a set of positive integers from 1 to n.
    In one step, the player can choose a positive integer from the set, and erase all of its divisors from the set. If a divisor doesn't exist it will be ignored.
    Alice and Bob choose in turn, the one who cannot choose (current set is empty) loses.
    Alice goes first, she wanna know whether she can win. Please judge by outputing 'Yes' or 'No'.
     
    Input
    There might be multiple test cases, no more than 10. You need to read till the end of input.
    For each test case, a line containing an integer n. (1n500)
     
    Output
    A line for each test case, 'Yes' or 'No'.
     
    Sample Input
    1
     
    Sample Output
    Yes
     
     
     
    之前邀请赛的原题,当是写了几个数发现的规律。但是不知道为什么。。。。
     
     
    其实可以把 1~n 转化为  2~n 
    如果2~n 先手必败的话,那么先手可以第一次选1,把必败状态转移给后手;
    如果2~n 先手必胜的话,多一个1其实是没有影响的。
    证毕;
     
     
    1 #include <bits/stdc++.h>
    2 #define lowbit(x) (x)&(-x)
    3 using namespace std;
    4 int main()
    5 {
    6     int n;
    7     while(~scanf("%d",&n))
    8     cout<<"Yes"<<endl;
    9 }
  • 相关阅读:
    逐步实现python版wc命令
    Linux中短横线(-)小记
    memcached启动脚本(class练习)
    nginx启动脚本(class练习)
    Python-类的方法
    re模块
    shutil模块
    时间模块(time/date)
    迭代器
    生成器
  • 原文地址:https://www.cnblogs.com/ACMerszl/p/9665370.html
Copyright © 2011-2022 走看看