Light OJ: 1401 – No More Tic-tac-toe / UVa 11534 – Say Goodbye to Tic-Tac-Toe

Problem Link :

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=2529

http://www.lightoj.com/volume_showproblem.php?problem=1401

Solutiono Idea: Straight Forward Grundy theory. Think a gap as a nim pile.


#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

#define pii              pair <int,int>
#define pll              pair <long long,long long>
#define sc               scanf
#define pf               printf
#define Pi               2*acos(0.0)
#define ms(a,b)          memset(a, b, sizeof(a))
#define pb(a)            push_back(a)
#define MP               make_pair
#define db               double
#define ll               long long
#define EPS              10E-10
#define ff               first
#define ss               second
#define sqr(x)           (x)*(x)
#define D(x)             cerr<<#x " = "<<(x)<<endl
#define VI               vector <int>
#define DBG              pf("Hi\n")
#define MOD              1000000007
#define CIN              ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define SZ(a)            (int)a.size()
#define sf(a)            scanf("%d",&a)
#define sfl(a)           scanf("%lld",&a)
#define sff(a,b)         scanf("%d %d",&a,&b)
#define sffl(a,b)        scanf("%lld %lld",&a,&b)
#define sfff(a,b,c)      scanf("%d %d %d",&a,&b,&c)
#define sfffl(a,b,c)     scanf("%lld %lld %lld",&a,&b,&c)
#define stlloop(v)       for(__typeof(v.begin()) it=v.begin();it!=v.end();it++)
#define loop(i,n)        for(int i=0;i<n;i++)
#define loop1(i,n)       for(int i=1;i<=n;i++)
#define REP(i,a,b)       for(int i=a;i<b;i++)
#define RREP(i,a,b)      for(int i=a;i>=b;i--)
#define TEST_CASE(t)     for(int z=1;z<=t;z++)
#define PRINT_CASE       printf("Case %d: ",z)
#define LINE_PRINT_CASE  printf("Case %d:\n",z)
#define CASE_PRINT       cout<<"Case "<<z<<": "
#define all(a)           a.begin(),a.end()
#define intlim           2147483648
#define infinity         (1<<28)
#define ull              unsigned long long
#define gcd(a, b)        __gcd(a, b)
#define lcm(a, b)        ((a)*((b)/gcd(a,b)))

using namespace std;

//using namespace __gnu_pbds;
//typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;


/*----------------------Graph Moves----------------*/
//const int fx[]={+1,-1,+0,+0};
//const int fy[]={+0,+0,+1,-1};
//const int fx[]={+0,+0,+1,-1,-1,+1,-1,+1};   // Kings Move
//const int fy[]={-1,+1,+0,+0,+1,+1,-1,-1};  // Kings Move
//const int fx[]={-2, -2, -1, -1,  1,  1,  2,  2};  // Knights Move
//const int fy[]={-1,  1, -2,  2, -2,  2, -1,  1}; // Knights Move
/*------------------------------------------------*/

/*-----------------------Bitmask------------------*/
//int Set(int N,int pos){return N=N | (1<<pos);}
//int reset(int N,int pos){return N= N & ~(1<<pos);}
//bool check(int N,int pos){return (bool)(N & (1<<pos));}
/*------------------------------------------------*/

char str[201];

int dp[102][3][3];

int grundy(int len, int lft, int rgt)
{
    if(len<=0) return 0;
    if(len==1 && lft==rgt && lft!=2) return 1;
    if(len==1 && lft!=rgt && lft!=2 && rgt!=2 ) return 0;
    int &ret=dp[len][lft][rgt];
    if(ret!=-1) return ret;
    set<int>st;
    for(int i=1; i<=len; i++)
    {
        int a=0,b=0;
        if(i==1)
        {
            if(lft!=0)
                {a=grundy(i-1,lft,0)^grundy(len-i,0,rgt);st.insert(a);}
            if(lft!=1)
                {b=grundy(i-1,lft,1)^grundy(len-i,1,rgt);st.insert(b);}
        }
        else if(i==len)
        {
            if(rgt!=0)
                {a=grundy(i-1,lft,0)^grundy(len-i,0,rgt);st.insert(a);}
            if(rgt!=1)
                {b=grundy(i-1,lft,1)^grundy(len-i,1,rgt);st.insert(b);}
        }
        else
        {
            a=grundy(i-1,lft,0)^grundy(len-i,0,rgt);
            b=grundy(i-1,lft,1)^grundy(len-i,1,rgt);
            st.insert(a);
            st.insert(b);
        }
    }

    int x=0;
    while(st.find(x)!=st.end()) x++;
    return ret=x;
}

int main()
{

//    freopen("in.txt","r",stdin);
//	  freopen("out.txt","w",stdout);

    int t;
    sf(t);
    ms(dp,-1);
    TEST_CASE(t)
    {
        scanf(" %s",str);
        int ans=0;
        int len=strlen(str);
        int last=-1;
        for(int i=0; i<len; i++)
        {
            if(str[i]!='.')
            {
                if(str[i]=='O')
                {
                    ans^=grundy(i-last-1,2,0);
                }
                else
                {
                    ans^=grundy(i-last-1,2,1);
                }
                last=i;
                break;
            }
        }

        for(int i=last+1; i<len; i++)
        {
            if(str[i]!='.')
            {
                if(str[i]=='O')
                {
                    ans^=grundy(i-last-1,str[last]=='X',0);
                }
                else
                {
                    ans^=grundy(i-last-1,str[last]=='X',1);
                }
                last=i;
            }
        }
        if(last==-1)
            ans^=grundy(len-last-1,2,2);
        else
            ans^=grundy(len-last-1,str[last]=='X',2);

//        PRINT_CASE;

        int cnt=0;
        for(int i=0; i<len; i++) cnt+=(str[i]!='.');
        if(cnt%2==0)
        {

            if(ans)
                printf("Possible.\n");
            else
                printf("Impossible.\n");
        }
        else
        {
            if(ans==0)
                printf("Possible.\n");
            else
                printf("Impossible.\n");
        }
    }

    return 0;
}


Advertisements

Light OJ 1229 – TREBLECROSS / UVa 10561 – Treblecross

Problem Link :

https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=1502

http://www.lightoj.com/volume_showproblem.php?problem=1229


#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
 
#define pii              pair <int,int>
#define pll              pair <long long,long long>
#define sc               scanf
#define pf               printf
#define Pi               2*acos(0.0)
#define ms(a,b)          memset(a, b, sizeof(a))
#define pb(a)            push_back(a)
#define MP               make_pair
#define db               double
#define ll               long long
#define EPS              10E-10
#define ff               first
#define ss               second
#define sqr(x)           (x)*(x)
#define D(x)             cerr<<#x " = "<<(x)<<endl
#define VI               vector <int>
#define DBG              pf("Hi\n")
#define MOD              1000000007
#define CIN              ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define SZ(a)            (int)a.size()
#define sf(a)            scanf("%d",&a)
#define sfl(a)           scanf("%lld",&a)
#define sff(a,b)         scanf("%d %d",&a,&b)
#define sffl(a,b)        scanf("%lld %lld",&a,&b)
#define sfff(a,b,c)      scanf("%d %d %d",&a,&b,&c)
#define sfffl(a,b,c)     scanf("%lld %lld %lld",&a,&b,&c)
#define stlloop(v)       for(__typeof(v.begin()) it=v.begin();it!=v.end();it++)
#define loop(i,n)        for(int i=0;i<n;i++)
#define loop1(i,n)       for(int i=1;i<=n;i++)
#define REP(i,a,b)       for(int i=a;i<b;i++)
#define RREP(i,a,b)      for(int i=a;i>=b;i--)
#define TEST_CASE(t)     for(int z=1;z<=t;z++)
#define PRINT_CASE       printf("Case %d: ",z)
#define LINE_PRINT_CASE  printf("Case %d:\n",z)
#define CASE_PRINT       cout<<"Case "<<z<<": "
#define all(a)           a.begin(),a.end()
#define intlim           2147483648
#define infinity         (1<<28)
#define ull              unsigned long long
#define gcd(a, b)        __gcd(a, b)
#define lcm(a, b)        ((a)*((b)/gcd(a,b)))
 
using namespace std;
 
//using namespace __gnu_pbds;
//typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
 
 
/*----------------------Graph Moves----------------*/
//const int fx[]={+1,-1,+0,+0};
//const int fy[]={+0,+0,+1,-1};
//const int fx[]={+0,+0,+1,-1,-1,+1,-1,+1};   // Kings Move
//const int fy[]={-1,+1,+0,+0,+1,+1,-1,-1};  // Kings Move
//const int fx[]={-2, -2, -1, -1,  1,  1,  2,  2};  // Knights Move
//const int fy[]={-1,  1, -2,  2, -2,  2, -1,  1}; // Knights Move
/*------------------------------------------------*/
 
/*-----------------------Bitmask------------------*/
//int Set(int N,int pos){return N=N | (1<<pos);}
//int reset(int N,int pos){return N= N & ~(1<<pos);}
//bool check(int N,int pos){return (bool)(N & (1<<pos));}
/*------------------------------------------------*/
 
//char str[400];
 
string str;
 
int dp[205];
 
int func(int m)
{
    if(m<=0) return 0;
    int &ret=dp[m];
    if(ret!=-1) return ret;
    set<int>st;
    for(int i=1;i<=m; i++)
    {
        st.insert(func(i-3)^func(m-i-2));
    }
    int x=0;
    while(st.find(x)!=st.end())x++;
    return ret=x;
}
 
bool solve(int idx)
{
    if(str[idx]=='X') return 0;
    string temp=str;
    temp[idx]='X';
    for(int i=0;i<SZ(temp)-2;i++)
    {
        if(temp[i]=='X' && temp[i+1]=='X' && temp[i+2]=='X') return 1;
    }
    for(int i=0;i<SZ(temp)-2;i++)
    {
        if(temp[i]=='X' && temp[i+2]=='X') return 0;
    }
    for(int i=0;i<SZ(temp)-1;i++)
    {
        if(temp[i]=='X' && temp[i+1]=='X') return 0;
    }
 
    int ans=0,last=-1;
    for(int i=0;i<SZ(temp);i++)
    {
        if(temp[i]=='X')
        {
            if(last==-1)
                ans^=func(i-last-3);
            else
                ans^=func(i-last-5);
            last=i;
        }
    }
    ans^=func(SZ(temp)-last-3);
    return ans==0;
}
 
int main()
{
    CIN;
//    freopen("in.txt","r",stdin);
//    freopen("out.txt","w",stdout);
 
    int t;
//    sf(t);
    cin>>t;
    ms(dp,-1);
    TEST_CASE(t)
    {
        cin>>str;
        vector<int>pos;
        for(int i=0;i<SZ(str);i++)
        {
            if(solve(i))
            {
                pos.pb(i+1);
            }
        }
        CASE_PRINT;
        if(SZ(pos)==0)
            cout<<0<<endl;
        else
        {
            cout<<pos[0];
            for(int i=1;i<SZ(pos);i++)
                cout<<" "<<pos[i];
            cout<<endl;
        }
    }
 
    return 0;
}

Light OJ: 1315 – Game of Hyper Knights

Problem Link : http://lightoj.com:81/volume/problem/1315


#include <bits/stdc++.h>

#define pii              pair <int,int>
#define pll              pair <long long,long long>
#define sc               scanf
#define pf               printf
#define Pi               2*acos(0.0)
#define ms(a,b)          memset(a, b, sizeof(a))
#define pb(a)            push_back(a)
#define MP               make_pair
#define db               double
#define ll               long long
#define EPS              10E-10
#define ff               first
#define ss               second
#define sqr(x)           (x)*(x)
#define D(x)             cout<<#x " = "<<(x)<<endl
#define VI               vector <int>
#define DBG              pf("Hi\n")
#define MOD              1000000007
#define CIN              ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define SZ(a)            (int)a.size()
#define sf(a)            scanf("%d",&a)
#define sfl(a)           scanf("%lld",&a)
#define sff(a,b)         scanf("%d %d",&a,&b)
#define sffl(a,b)        scanf("%lld %lld",&a,&b)
#define sfff(a,b,c)      scanf("%d %d %d",&a,&b,&c)
#define sfffl(a,b,c)     scanf("%lld %lld %lld",&a,&b,&c)
#define stlloop(v)       for(__typeof(v.begin()) it=v.begin();it!=v.end();it++)
#define loop(i,n)        for(int i=0;i<n;i++)
#define loop1(i,n)       for(int i=1;i<=n;i++)
#define REP(i,a,b)       for(int i=a;i<b;i++)
#define RREP(i,a,b)      for(int i=a;i>=b;i--)
#define TEST_CASE(t)     for(int z=1;z<=t;z++)
#define PRINT_CASE       printf("Case %d: ",z)
#define LINE_PRINT_CASE  printf("Case %d:\n",z)
#define CASE_PRINT       cout<<"Case "<<z<<": "
#define all(a)           a.begin(),a.end()
#define intlim           2147483648
#define infinity         (1<<28)
#define ull              unsigned long long
#define gcd(a, b)        __gcd(a, b)
#define lcm(a, b)        ((a)*((b)/gcd(a,b)))

using namespace std;


/*----------------------Graph Moves----------------*/
//const int fx[]={+1,-1,+0,+0};
//const int fy[]={+0,+0,+1,-1};
//const int fx[]={+0,+0,+1,-1,-1,+1,-1,+1};   // Kings Move
//const int fy[]={-1,+1,+0,+0,+1,+1,-1,-1};  // Kings Move
//const int fx[]={-2, -2, -1, -1,  1,  1,  2,  2};  // Knights Move
//const int fy[]={-1,  1, -2,  2, -2,  2, -1,  1}; // Knights Move
/*------------------------------------------------*/

/*-----------------------Bitmask------------------*/
//int Set(int N,int pos){return N=N | (1<<pos);}
//int reset(int N,int pos){return N= N & ~(1<<pos);}
//bool check(int N,int pos){return (bool)(N & (1<<pos));}
/*------------------------------------------------*/

int fx[]= {-2,-3,-2,-1,-1,+1};
int fy[]= {+1,-1,-1,-2,-3,-2};

int dp[2003][2003];

inline bool valid(int x,int y)
{
    if(x<0 || y<0) return 0;
    return 1;
}

int func(int x, int y)
{
    int &ret=dp[x][y];
    if(ret!=-1) return ret;

    int cnt=0;
    for(int i=0; i<6; i++)
        cnt+=valid(x+fx[i],y+fy[i]);
    if(cnt==0) return ret=0;

    set<int>st;

    for(int i=0; i<6; i++)
    {
        if(valid(x+fx[i],y+fy[i]))
            st.insert(func(x+fx[i],y+fy[i]));
    }

    int p=0;

    while(st.find(p)!=st.end()) p++;
    return ret=p;
}


int main()
{

//    freopen("in.txt","r",stdin);
    ///freopen("out.txt","w",stdout);

    int t;
    sf(t);

    ms(dp,-1);

    TEST_CASE(t)
    {
        int n;
        sf(n);

        int ans=0;

        for(int i=0; i<n; i++)
        {
            int a,b;
            sff(a,b);
            ans^=func(a,b);
        }

        PRINT_CASE;
        if(ans)
        {
            pf("Alice\n");
        }
        else
            pf("Bob\n");

    }

    return 0;
}

Light OJ : 1296 – Again Stone Game

Problem Link : http://lightoj.com:81/volume/problem/1296

Solution Idea: Just Find the pattern for smaller input and get AC 😛



#include <bits/stdc++.h>

#define pii              pair <int,int>
#define pll              pair <long long,long long>
#define sc               scanf
#define pf               printf
#define Pi               2*acos(0.0)
#define ms(a,b)          memset(a, b, sizeof(a))
#define pb(a)            push_back(a)
#define MP               make_pair
#define db               double
#define ll               long long
#define EPS              10E-10
#define ff               first
#define ss               second
#define sqr(x)           (x)*(x)
#define D(x)             cout<<#x " = "<<(x)<<endl
#define VI               vector <int>
#define DBG              pf("Hi\n")
#define MOD              1000000007
#define CIN              ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define SZ(a)            (int)a.size()
#define sf(a)            scanf("%d",&a)
#define sfl(a)           scanf("%lld",&a)
#define sff(a,b)         scanf("%d %d",&a,&b)
#define sffl(a,b)        scanf("%lld %lld",&a,&b)
#define sfff(a,b,c)      scanf("%d %d %d",&a,&b,&c)
#define sfffl(a,b,c)     scanf("%lld %lld %lld",&a,&b,&c)
#define stlloop(v)       for(__typeof(v.begin()) it=v.begin();it!=v.end();it++)
#define loop(i,n)        for(int i=0;i<n;i++)
#define loop1(i,n)       for(int i=1;i<=n;i++)
#define REP(i,a,b)       for(int i=a;i<b;i++)
#define RREP(i,a,b)      for(int i=a;i>=b;i--)
#define TEST_CASE(t)     for(int z=1;z<=t;z++)
#define PRINT_CASE       printf("Case %d: ",z)
#define LINE_PRINT_CASE  printf("Case %d:\n",z)
#define CASE_PRINT       cout<<"Case "<<z<<": "
#define all(a)           a.begin(),a.end()
#define intlim           2147483648
#define infinity         (1<<28)
#define ull              unsigned long long
#define gcd(a, b)        __gcd(a, b)
#define lcm(a, b)        ((a)*((b)/gcd(a,b)))

using namespace std;


/*----------------------Graph Moves----------------*/
//const int fx[]={+1,-1,+0,+0};
//const int fy[]={+0,+0,+1,-1};
//const int fx[]={+0,+0,+1,-1,-1,+1,-1,+1};   // Kings Move
//const int fy[]={-1,+1,+0,+0,+1,+1,-1,-1};  // Kings Move
//const int fx[]={-2, -2, -1, -1,  1,  1,  2,  2};  // Knights Move
//const int fy[]={-1,  1, -2,  2, -2,  2, -1,  1}; // Knights Move
/*------------------------------------------------*/

/*-----------------------Bitmask------------------*/
//int Set(int N,int pos){return N=N | (1<<pos);}
//int reset(int N,int pos){return N= N & ~(1<<pos);}
//bool check(int N,int pos){return (bool)(N & (1<<pos));}
/*------------------------------------------------*/


int main()
{

    ///freopen("in.txt","r",stdin);
    ///freopen("out.txt","w",stdout);

    int t;
    sf(t);
    TEST_CASE(t)
    {
        int n;
        sf(n);

        int ans=0;

        for(int i=0;i<n;i++)
        {
            int a;
            sf(a);
            while(a%2)
            {
                a/=2;
            }
            ans^=a/2;
        }

        PRINT_CASE;
        if(ans)
            pf("Alice\n");
        else
            pf("Bob\n");

    }

    return 0;
}


Light OJ: 1199 – Partitioning Game

Problem Link : http://lightoj.com:81/volume/problem/1199


#include <bits/stdc++.h>

#define pii              pair <int,int>
#define pll              pair <long long,long long>
#define sc               scanf
#define pf               printf
#define Pi               2*acos(0.0)
#define ms(a,b)          memset(a, b, sizeof(a))
#define pb(a)            push_back(a)
#define MP               make_pair
#define db               double
#define ll               long long
#define EPS              10E-10
#define ff               first
#define ss               second
#define sqr(x)           (x)*(x)
#define D(x)             cout<<#x " = "<<(x)<<endl
#define VI               vector <int>
#define DBG              pf("Hi\n")
#define MOD              1000000007
#define CIN              ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define SZ(a)            (int)a.size()
#define sf(a)            scanf("%d",&a)
#define sfl(a)           scanf("%lld",&a)
#define sff(a,b)         scanf("%d %d",&a,&b)
#define sffl(a,b)        scanf("%lld %lld",&a,&b)
#define sfff(a,b,c)      scanf("%d %d %d",&a,&b,&c)
#define sfffl(a,b,c)     scanf("%lld %lld %lld",&a,&b,&c)
#define stlloop(v)       for(__typeof(v.begin()) it=v.begin();it!=v.end();it++)
#define loop(i,n)        for(int i=0;i<n;i++)
#define loop1(i,n)       for(int i=1;i<=n;i++)
#define REP(i,a,b)       for(int i=a;i<b;i++)
#define RREP(i,a,b)      for(int i=a;i>=b;i--)
#define TEST_CASE(t)     for(int z=1;z<=t;z++)
#define PRINT_CASE       printf("Case %d: ",z)
#define LINE_PRINT_CASE  printf("Case %d:\n",z)
#define CASE_PRINT       cout<<"Case "<<z<<": "
#define all(a)           a.begin(),a.end()
#define intlim           2147483648
#define infinity         (1<<28)
#define ull              unsigned long long
#define gcd(a, b)        __gcd(a, b)
#define lcm(a, b)        ((a)*((b)/gcd(a,b)))

using namespace std;


/*----------------------Graph Moves----------------*/
//const int fx[]={+1,-1,+0,+0};
//const int fy[]={+0,+0,+1,-1};
//const int fx[]={+0,+0,+1,-1,-1,+1,-1,+1};   // Kings Move
//const int fy[]={-1,+1,+0,+0,+1,+1,-1,-1};  // Kings Move
//const int fx[]={-2, -2, -1, -1,  1,  1,  2,  2};  // Knights Move
//const int fy[]={-1,  1, -2,  2, -2,  2, -1,  1}; // Knights Move
/*------------------------------------------------*/

/*-----------------------Bitmask------------------*/
//int Set(int N,int pos){return N=N | (1<<pos);}
//int reset(int N,int pos){return N= N & ~(1<<pos);}
//bool check(int N,int pos){return (bool)(N & (1<<pos));}
/*------------------------------------------------*/

int dp[10005];

int func(int n)
{
    if(n==1 || n==2) return 0;

    if(dp[n]!=-1) return dp[n];

    set<int>st;

    int mid=n/2;
    if(n%2==0) mid--;

    for(int i=1;i<=mid;i++)
    {
        st.insert(func(i)^func(n-i));
    }

    int ret=0;
    while(st.find(ret)!=st.end()) ret++;
    return dp[n]=ret;
}

int main()
{

    ///freopen("in.txt","r",stdin);
    ///freopen("out.txt","w",stdout);

    ms(dp,-1);

    int t;
    sf(t);
    TEST_CASE(t)
    {
        int n;
        sf(n);

        int ans=0;

        for(int i=0;i<n;i++)
        {
            int a;
            sf(a);
            ans^=func(a);
        }

        PRINT_CASE;

        if(ans)
            pf("Alice\n");
        else
            pf("Bob\n");

    }

    return 0;
}


Light OJ : 1020 – A Childhood Game

Problem Link : http://www.lightoj.com/volume_showproblem.php?problem=1020


/*
         +-+ +-+ +-+
         |R| |.| |S|
         +-+ +-+ +-+
 */

#include <bits/stdc++.h>

#define pii             pair <int,int>
#define sc              scanf
#define pf              printf
#define Pi              2*acos(0.0)
#define ms(a,b)         memset(a, b, sizeof(a))
#define pb(a)           push_back(a)
#define MP              make_pair
#define db              double
#define ll              long long
#define EPS             10E-10
#define ff              first
#define ss              second
#define sqr(x)          (x)*(x)
#define D(x)            cout<<#x " = "<<(x)<<endl
#define VI              vector <int>
#define DBG             pf("Hi\n")
#define MOD             100007
#define MAX             10000
#define CIN             ios_base::sync_with_stdio(0); cin.tie(0)
#define SZ(a)           (int)a.size()
#define sf(a)           scanf("%d",&a)
#define sfl(a)          scanf("%lld",&a)
#define sff(a,b)        scanf("%d %d",&a,&b)
#define sffl(a,b)       scanf("%lld %lld",&a,&b)
#define sfff(a,b,c)     scanf("%d %d %d",&a,&b,&c)
#define sfffl(a,b,c)    scanf("%lld %lld %lld",&a,&b,&c)
#define loop(i,n)       for(int i=0;i<n;i++)
#define REP(i,a,b)      for(int i=a;i<b;i++)
#define TEST_CASE(t)    for(int z=1;z<=t;z++)
#define PRINT_CASE      printf("Case %d: ",z)
#define CASE_PRINT      cout<<"Case "<<z<<": ";
#define all(a)          a.begin(),a.end()
#define intlim          2147483648
#define inf             1000000
#define ull             unsigned long long

using namespace std;


/*----------------------Graph Moves----------------*/
//const int fx[]={+1,-1,+0,+0};
//const int fy[]={+0,+0,+1,-1};
//const int fx[]={+0,+0,+1,-1,-1,+1,-1,+1};   // Kings Move
//const int fy[]={-1,+1,+0,+0,+1,+1,-1,-1};  // Kings Move
//const int fx[]={-2, -2, -1, -1,  1,  1,  2,  2};  // Knights Move
//const int fy[]={-1,  1, -2,  2, -2,  2, -1,  1}; // Knights Move
/*------------------------------------------------*/

/*-----------------------Bitmask------------------*/
//int Set(int N,int pos){return N=N | (1<<pos);}
//int reset(int N,int pos){return N= N & ~(1<<pos);}
//bool check(int N,int pos){return (bool)(N & (1<<pos));}
/*------------------------------------------------*/

//int check(int x)
//{
//    if(x==0) return 1;
//    if(x==1) return 0;
//    if(x==2) return 1;
//
//    int a=0,b=0;
//
//    a=check(x-1);
//    if(a==0) return 1;
//    return 1^check(x-2);
//}

int ara1[]={0,1,1};
int ara2[]={1,0,1};

int main()
{
//    CIN;
    ///freopen("in.txt","r",stdin);
    ///freopen("out.txt","w",stdout);

//    loop(i,21)
//    cout<<check(i+1);

    int t;
    cin>>t;
    TEST_CASE(t)
    {
        ll n;
        string str;
        cin>>n>>str;

        CASE_PRINT;

        if(str=="Alice")
        {
            n=n%3;
            if(ara2[n])
                cout<<"Alice"<<endl;
            else
                cout<<"Bob"<<endl;

        }

        else
        {
            n%=3;
            if(ara1[n])
                cout<<"Bob"<<endl;
            else
                cout<<"Alice"<<endl;
        }

    }

    return 0;
}