uva 10404 Problem B: Bachet's Game 迭代

来源：互联网发布：云图网络电视编辑：程序博客网时间：2024/06/07 23:42

#include<iostream>#include<cstdio>#include<cstdlib>#include<cmath>#include<string>#include<cstring>#include<algorithm>#include<queue>#include<climits>#include<stack>#include<map>using namespace std;int n,m;int d[1000005];int da[12];int main(){    //freopen("in.txt","r",stdin);    while(cin>>n>>m)    {        memset(d,-1,sizeof(d));        for(int i=0; i<m; i++)        {            cin>>da[i];            d[da[i]]=1;        }        for(int i=1; i<=n; i++)        {            if(d[i]!=-1)continue;            int flag=0;            for(int j=0; j<m; j++)            {                if(i-da[j]>0)                {                    if(d[i-da[j]]==0)                        flag=1;                }            }            d[i]=flag;        }        if(d[n]==1)            cout<<"Stan wins"<<endl;        else if(d[n]==0)            cout<<"Ollie wins"<<endl;    }}

0 0