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

Code 1:
/*Author : KRISH JHA */
/*scholar id : 2312119*/

#include<bits/stdc++.h>
using namespace std;

#define endl "\n"
#define allv  v.begin() , v.end()
#define rallv v.rbegin() , v.rend()
#define yes   cout<<"YES\n"
#define no    cout<<"NO\n"

/********************************************** Debug Code **************************************************/
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename A>
void __print(const A &x);
template <typename A, typename B>
void __print(const pair<A, B> &p);
template <typename... A>
void __print(const tuple<A...> &t);
template <typename T>
void __print(stack<T> s);
template <typename T>
void __print(queue<T> q);
template <typename T, typename... U>
void __print(priority_queue<T, U...> q);
template <typename A>
void __print(const A &x) {
    bool first = true;
    cerr << '{';
    for (const auto &i : x) {
        cerr << (first ? "" : ","), __print(i);
        first = false;
    }
    cerr << '}';
}
template <typename A, typename B>
void __print(const pair<A, B> &p) {
    cerr << '(';
    __print(p.first);
    cerr << ',';
    __print(p.second);
    cerr << ')';
}
template <typename... A>
void __print(const tuple<A...> &t) {
    bool first = true;
    cerr << '(';
    apply([&first](const auto &...args) { ((cerr << (first ? "" : ","), __print(args), first = false), ...); }, t);
    cerr << ')';
}
template <typename T>
void __print(stack<T> s) {
    vector<T> debugVector;
    while (!s.empty()) {
        T t = s.top();
        debugVector.push_back(t);
        s.pop();
    }
    reverse(debugVector.begin(), debugVector.end());
    __print(debugVector);
}
template <typename T>
void __print(queue<T> q) {
    vector<T> debugVector;
    while (!q.empty()) {
        T t = q.front();
        debugVector.push_back(t);
        q.pop();
    }
    __print(debugVector);
}
template <typename T, typename... U>
void __print(priority_queue<T, U...> q) {
    vector<T> debugVector;
    while (!q.empty()) {
        T t = q.top();
        debugVector.push_back(t);
        q.pop();
    }
    __print(debugVector);
}
void _print() { cerr << "]\n"; }
template <typename Head, typename... Tail>
void _print(const Head &H, const Tail &...T) {
    __print(H);
    if (sizeof...(T))
        cerr << ", ";
    _print(T...);
}
#ifndef ONLINE_JUDGE
#define debug(...) cerr << "Line:" << __LINE__ << " [" << #__VA_ARGS__ << "] = ["; _print(__VA_ARGS__)
#else
#define debug(...)
#endif
/****************************************** Debug Code Ends ***************************************************************************************/
 
 
int gcd(int a , int b){if(a == 0) return b;return gcd( b % a , a);}
 
bool comp(pair<int,int> a , pair<int , int> b){
   return a.first > b.first;
}
 
int findmax(int a , int b){if(a > b) return a;else return b;}
 
#define int long long

/********************************************* Code starts from here  *************************************************/

void solve(){

    int l , r;
    cin >> l >> r;

    if(r - l + 1 == 3){
        cout << l << ' ' << l + 1 << ' ' << r << ' ' << endl;
        return;
    }

    int a = 0 , b = 0 , c = 0;
    for(int i = 29 ; i >= 0; i--){
        if((l & (1 << i)) != (r & (1 << i))){
            a |= (1 << i);
            break;
        }
        else{
            a |= (l & (1 << i));
        }
    }

    b = a - 1;

    for(int i = l ;i <= r ; i++){
        if(i != a && i != b) {
            c = i;
            break;
        }
    }

    cout << a << ' ' << b  << ' ' << c << endl;

}

signed main() {

    #ifndef ONLINE_JUDGE
    freopen("input1.txt", "r", stdin);
    freopen("output1.txt", "w", stdout);
    #endif

    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
     
    
    // int t = 1; 

    int t; 
    cin >> t;
    for(int i = 1; i <= t; i++) {
        solve();
    }
    return 0;

}

Code 2:
/*Author : KRISH JHA */
/*scholar id : 2312119*/

#include<bits/stdc++.h>
using namespace std;

#define endl "\n"
#define allv  v.begin() , v.end()
#define rallv v.rbegin() , v.rend()
#define yes   cout<<"YES\n"
#define no    cout<<"NO\n"

/********************************************** Debug Code **************************************************/
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename A>
void __print(const A &x);
template <typename A, typename B>
void __print(const pair<A, B> &p);
template <typename... A>
void __print(const tuple<A...> &t);
template <typename T>
void __print(stack<T> s);
template <typename T>
void __print(queue<T> q);
template <typename T, typename... U>
void __print(priority_queue<T, U...> q);
template <typename A>
void __print(const A &x) {
    bool first = true;
    cerr << '{';
    for (const auto &i : x) {
        cerr << (first ? "" : ","), __print(i);
        first = false;
    }
    cerr << '}';
}
template <typename A, typename B>
void __print(const pair<A, B> &p) {
    cerr << '(';
    __print(p.first);
    cerr << ',';
    __print(p.second);
    cerr << ')';
}
template <typename... A>
void __print(const tuple<A...> &t) {
    bool first = true;
    cerr << '(';
    apply([&first](const auto &...args) { ((cerr << (first ? "" : ","), __print(args), first = false), ...); }, t);
    cerr << ')';
}
template <typename T>
void __print(stack<T> s) {
    vector<T> debugVector;
    while (!s.empty()) {
        T t = s.top();
        debugVector.push_back(t);
        s.pop();
    }
    reverse(debugVector.begin(), debugVector.end());
    __print(debugVector);
}
template <typename T>
void __print(queue<T> q) {
    vector<T> debugVector;
    while (!q.empty()) {
        T t = q.front();
        debugVector.push_back(t);
        q.pop();
    }
    __print(debugVector);
}
template <typename T, typename... U>
void __print(priority_queue<T, U...> q) {
    vector<T> debugVector;
    while (!q.empty()) {
        T t = q.top();
        debugVector.push_back(t);
        q.pop();
    }
    __print(debugVector);
}
void _print() { cerr << "]\n"; }
template <typename Head, typename... Tail>
void _print(const Head &H, const Tail &...T) {
    __print(H);
    if (sizeof...(T))
        cerr << ", ";
    _print(T...);
}
#ifndef ONLINE_JUDGE
#define debug(...) cerr << "Line:" << __LINE__ << " [" << #__VA_ARGS__ << "] = ["; _print(__VA_ARGS__)
#else
#define debug(...)
#endif
/****************************************** Debug Code Ends ***************************************************************************************/
 
 
int gcd(int a , int b){if(a == 0) return b;return gcd( b % a , a);}
 
bool comp(pair<int,int> a , pair<int , int> b){
   return a.first > b.first;
}
 
int findmax(int a , int b){if(a > b) return a;else return b;}
 
#define int long long

/********************************************* Code starts from here  *************************************************/

void solve(){

    int l , r;
    cin >> l >> r;

    if(r - l + 1 == 3){
        cout << l << ' ' << l + 1 << ' ' << r << ' ' << endl;
        return;
    }

    int a = 0 , b = 0 , c = 0;
    for(int i = 29 ; i >= 0; i--){
        if((l & (1 << i)) != (r &  (1 << i))){
            a |= (1 << i);
            break;
        }
    }

    b = a - 1;

    for(int i = l ;i <= r ; i++){
        if(i != a && i != b) {
            c = i;
            break;
        }
    }

    cout << a << ' ' << b  << ' ' << c << endl;

}

signed main() {

    #ifndef ONLINE_JUDGE
    freopen("input1.txt", "r", stdin);
    freopen("output1.txt", "w", stdout);
    #endif

    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
     
    
    // int t = 1; 

    int t; 
    cin >> t;
    for(int i = 1; i <= t; i++) {
        solve();
    }
    return 0;

}

Answer: 1