D. 1-2-K Game(博弈+规律)

https://codeforces.com/problemset/problem/1194/D

---

思路:

以前做过取1个，2个，3个的问题。答案是%4来看。

这次是k个，通过人工打必胜态和必败态可以观察得到，k%3!=0时，和1，2一致。

k%3==0时，打出k=3,k=6,k=9即可得出规律

#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=1e5;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
int main(void)
{
  cin.tie(0);std::ios::sync_with_stdio(false);
  LL t;cin>>t;
  while(t--){
    LL n,k;cin>>n>>k;
    if(k%3!=0){
        if(n%3==0){
            cout<<"Bob"<<"\n";
        }
        else cout<<"Alice"<<"\n";
    }
    else if(k%3==0){

        if( n%(k+1)==0 ){
            cout<<"Bob"<<"\n";
        }
        else if(  ( n%(k+1) )%3==0&&( n%(k+1)!=k )  ) {
            cout<<"Bob"<<"\n";
        }
        else{
            cout<<"Alice"<<"\n";
        }
    }
  }
return 0;
}