【博弈论】POJ[2348]Euclid's Game

最新推荐文章于 2018-04-13 20:59:17 发布

Balala_Energy

最新推荐文章于 2018-04-13 20:59:17 发布

阅读量457

点赞数

分类专栏：博弈论文章标签：博弈论

本文链接：https://blog.csdn.net/Balala_Energy/article/details/52070803

版权

博弈论专栏收录该内容

1 篇文章 0 订阅

订阅专栏

好久不写博客了最近在佳木斯培训蒟蒻QAQ

今天来揭露一下这个虚伪的世界

【问题描述】
Two players, Stan and Ollie, play, starting with two natural numbers. Stan, the first player, subtracts any positive multiple of the lesser of the two numbers from the greater of the two numbers, provided that the resulting number must be nonnegative. Then Ollie, the second player, does the same with the two resulting numbers, then Stan, etc., alternately, until one player is able to subtract a multiple of the lesser number from the greater to reach 0, and thereby wins. For example, the players may start with (25,7): an Stan wins.
给定a,b;每次用大的数减去小的数的任意倍，保证结果是自然数，已知Stan先手，求在最优策略下，先手胜负情况。

【问题分析】

bool dfs(int a,int b)
{
    if (a==0||b==0)
        return false;
    if (a<b)
        swap(a,b);
    for (int i=1;i*b<a;i++)
        if (!dfs(a-i*b,b))
            return true;
    return false;       
}

第一反应但是发现RE了这时候老师告诉我需要一些

奇淫巧技

然后我的AC代码是这样的

#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
int a,b;
bool dfs(int a,int b)
{
    if (a==0||b==0)
        return false;
    if (a<b)
        swap(a,b);
    for (int i=a/b;i>0;i--)
        if (!dfs(a-i*b,b))
            return true;
    return false;       
}
int main()
{
    while(1)
    {
        scanf("%d%d",&a,&b);
        if (a==0&&b==0)
            break;
        if (dfs(a,b))
            printf("Stan wins\n");
        else
            printf("Ollie wins\n");
    }
    return 0;
}