1618F - Reverse - CodeForces Solution

#include <bits/stdc++.h>
using namespace std;
#define int               long long
#define pb                push_back
#define ppb               pop_back
#define pf                push_front
#define ppf               pop_front
#define all(x)            (x).begin(),(x).end()
#define fr                first
#define sc                second
#define rep(i,a,b)        for(int i=a;i<b;i++)
#define mem1(a)           memset(a,-1,sizeof(a))
#define mem0(a)           memset(a,0,sizeof(a))
#define ppc               __builtin_popcount
#define ppcll             __builtin_popcountll
#define debug(x)  cout<<(x)<<'\n';


const long long INF=1e18;
const int32_t M=1e9+7;
const int32_t MM=998244353;

const int N=0;

int y;
string s1;

map<pair<string,string>,bool> m;
bool test(string& s,int c)
{

if(s==s1)
{
   
    return true;
}
bool ans=false;
if(m[{s,s1}])
{
    return false;
}


m[{s,s1}]=true;


{
int cnt=0;
for(int i=s.size()-1;i>=0;i--)
{
    if(s[i]=='1')
    {
        break;
    }
    s.ppb();
    cnt++;
}

reverse(all(s));

ans=ans|test(s,c+1);
reverse(all(s));

for(int i=0;i<cnt;i++)
{
s.pb('0');
}

}
if(s.length()<70)
{

s.pb('1');
reverse(all(s));
ans=ans|test(s,c+1);
reverse(all(s));
s.ppb();

}

return ans;

}



void solve(){
   
int x;
cin>>x>>y;

s1.clear();
map<int,int> m;
while(y)
{
if(y%2)
{
    s1.pb('1');
}
else s1.pb('0');

y=y/2;
}
reverse(all(s1));
string curr;
while(x)
{
if(x%2)
{
    curr.pb('1');
}
else curr.pb('0');
x=x/2;

}
reverse(all(curr));
if(test(curr,0))
{
    cout<<"YES"<<'\n';

}
else cout<<"NO"<<'\n';
    
}
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);

    int t=1;
    
    while(t--) solve();
    return 0;
}