HDU

来源：互联网发布：星光大道网络投票编辑：程序博客网时间：2024/06/05 05:04

题目：给你一个数n，游戏者从p=1开始，游戏者给p*i，2<=i<=9，谁先到达p>=n，谁就获胜

思路：求出1的sg值

代码：

#pragma comment(linker, "/STACK:1024000000,1024000000")#include<iostream>#include<algorithm>#include<ctime>#include<cstdio>#include<cmath>#include<cstring>#include<string>#include<vector>#include<map>#include<set>#include<queue>#include<stack>#include<list>#include<numeric>using namespace std;#define LL long long#define ULL unsigned long long//#define INF 0x3f3f3f3fn#define mm(a,b) memset(a,b,sizeof(a))#define PP puts("*********************");template<class T> T f_abs(T a){ return a > 0 ? a : -a; }template<class T> T gcd(T a, T b){ return b ? gcd(b, a%b) : a; }template<class T> T lcm(T a,T b){return a/gcd(a,b)*b;}// 0x3f3f3f3f3f3f3f3f//0x3f3f3f3fmap<LL,LL> mp;LL lim;LL dfs(LL n){    if(mp.count(n))        return mp[n];    if(n>=lim){        mp[n]=0;        return 0;    }    set<LL> s;    for(LL i=2;i<=9;i++){        LL x=dfs(n*i);        s.insert(x);    }    for(LL i=0;;i++)        if(!s.count(i)){            mp[n]=i;            return i;        }}int main(){    LL n;    while(~scanf("%lld",&n)){        mp.clear();        lim=n;        LL ans=dfs(1);        if(ans>0) printf("Stan wins.\n");        else printf("Ollie wins.\n");    }    return 0;}

阅读全文

0 0