HackerEarth: Mojo,Jojo and Game( Game Theory )

HackerEarth: Mojo,Jojo and Game( Game Theory )
///==================================================///
///                HELLO WORLD !!                    ///
///                  IT'S ME                         ///
///               BISHAL GAUTAM                      ///
///         [ bsal.gautam16@gmail.com ]              ///
///==================================================///
#include<bits/stdc++.h>
#define X first
#define Y second
#define mpp make_pair
#define nl printf("\n")
#define SZ(x) (int)(x.size())
#define pb(x) push_back(x)
#define pii pair<int,int>
#define pll pair<ll,ll>
///---------------------
#define S(a) scanf("%d",&a)
#define P(a) printf("%d",a)
#define SL(a) scanf("%lld",&a)
#define S2(a,b) scanf("%d%d",&a,&b)
#define SL2(a,b) scanf("%lld%lld",&a,&b)
///------------------------------------
#define all(v) v.begin(),v.end()
#define CLR(a) memset(a,0,sizeof(a))
#define SET(a) memset(a,-1,sizeof(a))
#define fr(i,a,n) for(int i=a;i<=n;i++)
using namespace std;
typedef long long ll;
///==========CONSTANTS=============///
///  Digit     0123456789012345678 ///
#define MX     1005
#define inf    10000000000
#define MD     1000000007
#define eps    1e-9
///===============================///

map< pair<int,int> ,int >dp;

int go(int n,int x){
    if( n==0 ) return 0;
    if( x==0 ) return 0;
    if( dp.find( mpp(n,x) )!=dp.end() ) return dp[ mpp(n,x) ];
    int &ret=dp[mpp(n,x)];
    ret=0;
    set<int>St;
    if( n>=1 ) St.insert( go(n-1,x) );
    if( n>=2 ) St.insert( go(n-2,x) );
    St.insert( go(n, x-(x+1)/2 ) );
    int mn=0;
    for(set<int>:: iterator it=St.begin();it!=St.end();it++){
        if((*it)!=mn)break;
        mn++;
    }
    return (ret=mn);
}

int Go(int n,int x){
    ///Return 1 if Mojo
    if( n<=2 ) return 1;
    n-=3;
    n%=3;
    if(n==2) return 1;
    if(n==0){
        int len=32-__builtin_clz(x);
        return (len&1);
    }
    if(n==1){
        if(x<=3) return 1;
        int len=32-__builtin_clz(x);
        return (len%2==0);
    }
    return 0;
}

int main() {
    int tc,cs=1,n,x;
    S(tc);
    while(tc--){
        S2(n,x);
       // int yy=go(n,x);
        int xx=Go(n,x);
        if(xx) printf("Mojo\n");
        else printf("Jojo\n");
    }
    return 0;
}