Problem: 2057C - Trip to the Olympiad
Language: c++23 

Code 1:
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <stack>
#include <set>

#include <map>
#include <cctype>
#include <cstdio>
#include <numeric>
#define ll long long
#define LOG2(n) __lg(n)
#define SET_BIT_COUNTLL(x) __builtin_popcountll(x)
#define SET_BIT_COUNT(x) __builtin_popcount(x)
#define FAST ios::sync_with_stdio(0);cin.tie(nullptr);cout.tie(nullptr);
#define all(v) v.begin(),v.end()
#define allr(v) v.rbegin(),v.rend()
#define lp(var,inti,size) for(int var = inti ; var < size ; var ++)
#define fori(size) for(ll i=0; i < (size); i++)
#define foril(size) for(ll i=(size-1); i >= 0; --i)
#define forj(size) for(ll j=0; j < (size); j++)
#define fork(size) for(ll k=0; k < (size); k+= 1)
#define forl(size) for(ll l=0; l < (size); l+= 1)
const float pi = 3.14;
const long long oo = 9223372036854775807;
using namespace std;
#define oo 1e9
#define pb push_back
#define endll "\n"
#define make_unique(x) sort(all((x))); (x).resize(unique(all((x))) - (x).begin())
#define mp make_pair
#define yes cout<<"YES"<<endll
#define no cout<<"NO"<<endll

const ll MOD = 1e9 + 7, MOD2 = 1e9 + 9;
const ll N = 1e6 + 9;
using namespace std;

typedef pair<ll, ll> pii;
typedef pair<ll, pii> ppi;
typedef vector<ll> vec;
void fast() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); }

vector<ll> fibNumbers(1e7, 1);

set<ll> primeo;



ll  dpadep(vec &dpadepo, ll fo) {
    if (fo > 1000)return 0;
    else {
        dpadepo.push_back(fo);
        dpadep(dpadepo, fo * 10 + 7);
        return dpadep(dpadepo, fo * 10 + 4);
    }

}
void TT() {

    long long n, t, m = 0, c = 0, sum = 0, real_sum = 0, c_sofar = 0, sum_sofar = 0; ll a, b = 1, k, r, l, ans = 0;
    string sl,sr;
    cin >>l>>r;
    vec x; t = l;
    map <ll, ll>lolo;
    while (l) {
        if (l % 2)sl =  sl+"1"  ;
        else sl = sl +"0"  ;
        l = l/ 2;
   }
    while (r) {
        if (r % 2)sr =  sr+"1";
        else sr =  sr +"0" ;
        r = r / 2;
    }
    if (sr.length() > sl.length()) {
        if (((1 << sr.length() - 1) - 1) != t)   cout << (1 << sr.length() - 1) << " " << (1 << sr.length() - 1) - 1 << " " << t << endl;
        else cout << t << " " << t + 1 << " " << t + 2<<endl;
    }
    else {
        c = sr.length()-1;
        while (sr[c] == sl[c]) { 
            if (sr[c] - '0')ans += (1ll << c);
            c--;
      
        }
       if(t!=ans+( (1ll << c) - 1 )) cout << ans+(1ll << c) << " " << ans+(1ll << c) - 1 << " " << t << endl;
       else cout << ans+(1ll << c) << " " << ans+(1ll << c) + 1 << " " << 
           t << endl;
    }

}


/* if (b > n) {         QWE
        cout << n << endl;;
    }
    else if (a) {
        ans = n - 1 - b+a;
        ans /= a;
        cout <<n- ans << endl;
    }
    else {
        
        if (n == 1) {
            if (b)cout << 1<<endl;
            else cout << 0 << endl;;
        }
        else if(b) cout << n - 1 << endl;
        else  cout << -1 << endl;;
    }*/




int main() {
    fast();
   
    int n = 1;
    cin >> n;
    ll s = 0;
    while (n--) { TT();  }
}
// Owvx


Code 2:
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <stack>
#include <set>

#include <map>
#include <cctype>
#include <cstdio>
#include <numeric>
#define ll long long
#define LOG2(n) __lg(n)
#define SET_BIT_COUNTLL(x) __builtin_popcountll(x)
#define SET_BIT_COUNT(x) __builtin_popcount(x)
#define FAST ios::sync_with_stdio(0);cin.tie(nullptr);cout.tie(nullptr);
#define all(v) v.begin(),v.end()
#define allr(v) v.rbegin(),v.rend()
#define lp(var,inti,size) for(int var = inti ; var < size ; var ++)
#define fori(size) for(ll i=0; i < (size); i++)
#define foril(size) for(ll i=(size-1); i >= 0; --i)
#define forj(size) for(ll j=0; j < (size); j++)
#define fork(size) for(ll k=0; k < (size); k+= 1)
#define forl(size) for(ll l=0; l < (size); l+= 1)
const float pi = 3.14;
const long long oo = 9223372036854775807;
using namespace std;
#define oo 1e9
#define pb push_back
#define endll "\n"
#define make_unique(x) sort(all((x))); (x).resize(unique(all((x))) - (x).begin())
#define mp make_pair
#define yes cout<<"YES"<<endll
#define no cout<<"NO"<<endll

const ll MOD = 1e9 + 7, MOD2 = 1e9 + 9;
const ll N = 1e6 + 9;
using namespace std;

typedef pair<ll, ll> pii;
typedef pair<ll, pii> ppi;
typedef vector<ll> vec;
void fast() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); }

vector<ll> fibNumbers(1e7, 1);

set<ll> primeo;



ll  dpadep(vec &dpadepo, ll fo) {
    if (fo > 1000)return 0;
    else {
        dpadepo.push_back(fo);
        dpadep(dpadepo, fo * 10 + 7);
        return dpadep(dpadepo, fo * 10 + 4);
    }

}
void TT() {

    long long n, t, m = 0, c = 0, sum = 0, real_sum = 0, c_sofar = 0, sum_sofar = 0; ll a, b = 1, k, r, l, ans = 0;
    string sl,sr;
    cin >>l>>r;
    vec x; t = l;
    map <ll, ll>lolo;
    while (l) {
        if (l % 2)sl = "1" + sl;
        else sl = "0" + sl;
        l = l/ 2;
   }
    while (r) {
        if (r % 2)sr = "1" + sr;
        else sr = "0" + sr;
        r = r / 2;
    }
    if (sr.length() > sl.length()) {
        if (((1 << sr.length() - 1) - 1) != t)   cout << (1 << sr.length() - 1) << " " << (1 << sr.length() - 1) - 1 << " " << t << endl;
        else cout << t << " " << t + 1 << " " << t + 2<<endl;
    }
    else {
        c = sr.size()-1;
        while (sr[c] == sl[c]) { 
            if (sr[c] - '0')ans += (1ll << c);
            c--;
      
        }
       if(t!=ans+( (1ll << c) - 1 )) cout << ans+(1ll << c) << " " << ans+(1ll << c) - 1 << " " << t << endl;
       else cout << ans+(1 << c) << " " << ans+(1 << c) + 1 << " " << 
           t << endl;
    }

}


/* if (b > n) {         QWE
        cout << n << endl;;
    }
    else if (a) {
        ans = n - 1 - b+a;
        ans /= a;
        cout <<n- ans << endl;
    }
    else {
        
        if (n == 1) {
            if (b)cout << 1<<endl;
            else cout << 0 << endl;;
        }
        else if(b) cout << n - 1 << endl;
        else  cout << -1 << endl;;
    }*/




int main() {
    fast();
   
    int n = 1;
    cin >> n;
    ll s = 0;
    while (n--) { TT();  }
}
// Owvx


Answer: 1