UVA 10404 Bachet's Game

标签：dp   博弈   

DP+博弈。

m块石子，n种取法。两人看谁取到最后。只需要判断一下dp[i- c[] ] 递推 dp[ i ]。

#include<cstdio>
#include<cstring>
#include<string>
#include<queue>
#include<algorithm>
#include<map>
#include<stack>
#include<iostream>
#include<list>
#include<set>
#include<bitset>
#include<vector>
#include<cmath>

#define INF 0x7fffffff
#define eps 1e-8
#define LL long long
#define PI 3.141592654
#define CLR(a,b) memset(a,b,sizeof(a))
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define FOR_(i,a,b) for(int i=a;i>=b;i--)
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define mp make_pair
#define ft first
#define sd second
#define sf scanf
#define pf printf
#define sz(v) ((int)(v).size())
#define all(v) (v).begin(),(v).end()
#define acfun std::ios::sync_with_stdio(false)

#define SIZE 1000000  +1
using namespace std;

int m,n,dp[SIZE];

int main()
{
    int cost[11];
    while(~sf("%d%d",&m,&n))
    {
        FOR(i,0,n)
        sf("%d",&cost[i]);
        FOR(i,0,m+1)
        {
            dp[i]=0;
            FOR(j,0,n)
            {
                if(i>=cost[j]&&!dp[i-cost[j]])
                {
                    dp[i]=1;
                    break;
                }
            }
        }
//        FOR(i,0,m+1)
//        pf("%d: %d\n",i,dp[i]);
        if(dp[m])
            puts("Stan wins");
        else
            puts("Ollie wins");
    }
}

UVA 10404 Bachet's Game

标签：dp   博弈   

原文地址：http://blog.csdn.net/dongshimou/article/details/41543983