zoukankan      html  css  js  c++  java
  • hdu6312 2018杭电多校第二场 1004 D Game 博弈

    Game

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


    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
     
    Source
     
    Recommend
    chendu   |   We have carefully selected several similar problems for you:  6318 6317 6316 6315 6314 
     
    题意:给你一串数字,A和B分别可以对这串数字进行操作,每次操作可以删去一个数及他所有的因子,轮到谁时谁无法再进行操作谁就输了
    首先考虑1-n,我们可以先不看1,则2-n一定有一个胜者,如果这个状态A胜的话,我们就可以选择那个让我们胜的数,因为1是所有数的因子所以1也会被删去,如果A输,我们可以先去掉1来转变状态。这样A还是会胜。
    综述A一定会获胜
     
    #include<iostream>
    using namespace std;
    int main() {
        int n;
        while( cin >> n ) {
            cout << "Yes" << endl;
        }
        return 0;
    }
    

      

    彼时当年少,莫负好时光。
  • 相关阅读:
    js学习之函数
    面试题
    渐进增强(progressive enhancement)、优雅降级(graceful degradation)
    倒计时
    css 平行四边形
    网址URL分解
    图片延时加载
    获取元素的宽高,左边距上边距
    电商平台放大镜效果
    js笔记
  • 原文地址:https://www.cnblogs.com/l609929321/p/9368581.html
Copyright © 2011-2022 走看看