Problem: 2057C - Trip to the Olympiad
Language: C++17 (GCC 7-32)

Previous submission (verdict: Wrong answer on test 1):
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <chrono>
#define pb push_back
#define INF 0x3f3f3f3f
#define LINF 0x3f3f3f3f3f3f3f3f
#define endl '\n'
#define ll long long
#define f first
#define fin cin
#define fout cout
#define s second
#define FAST cin.tie(0), cout.tie(0), ios::sync_with_stdio(0)
#define debug(x) cout << "DEBUG " << x << endl
#define debug2(x, y) cout << "DEBUG " << x << " " << y << endl
#define debug3(x, y, z) cout << "DEBUG " << x << " " << y << " " << z<< endl
#define debug4(x, y, z, o) cout << "DEBUG " << x << " " << y << " " << z<< " " << o << endl
#define all(x) x.begin(), x.end()
#define left esquerda
#define lb lower_bound
#define right direita
using namespace std;
void setIO(string s) {
ios_base::sync_with_stdio(0); cin.tie(0);
freopen((s+".in").c_str(),"r",stdin);
freopen((s+".out").c_str( ),"w",stdout);
}
typedef pair<ll, ll> pii;
typedef vector<vector<char>> mat;
typedef pair<int, string> pis;
const ll mod = 1e9 + 7, MAXN = 2e5 + 5;
typedef vector<int> vi;
typedef pair<int, pair<int, int>> piii;

void solve() {
    ll l, r;
    cin >> l >> r;

    ll last = 1;
    while(last * 2 <= r) 
        last *= 2;

    if(last - 1 >= l && last + 1 <= r) {
        cout << last - 1 << " " << last << " " << last + 1 << endl;
        return;
    }

    if(last == r) {
        cout << l << " " << last - 1 << " " << last << endl;
        return;
    }

    if(last == l) {
        cout << r << " " << r << " " << l << endl;
    }


    ll aux = last;
    for(int i = 30; i >= 0 ; i--) 
        if(aux + (1ll << i) <= r && !(r & (1<<i)) ) {
            aux += (1ll <<i);
        }
    
    if(aux <= l)
        aux = l;

    cout << r << " " << r << " " << aux << endl;
}

int32_t main() {
    int ct;
    cin >> ct;
    while(ct--)
        solve();
}

Submission (verdict: Wrong answer on test 1):
#include<bits/stdc++.h>
using namespace std;


#define fastio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define MOD 1000000007
#define MOD1 998244353
#define INF 1e18
#define nline "\n"
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define ff first
#define ss second
#define PI 3.141592653589793238462
#define set_bits __builtin_popcountll
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()


typedef long long ll;
typedef unsigned long long ull;
typedef long double lld;

ll gcd(ll a, ll b){
    return (b==0)?a:gcd(b, a%b);
}

#ifndef ONLINE_JUDGE
#define debug(x) cerr << #x <<" "; _print(x); cerr << endl;
#else
#define debug(x)
#endif



void _print(ll t) {cerr << t;}
void _print(int t) {cerr << t;}
void _print(string t) {cerr << t;}
void _print(char t) {cerr << t;}
void _print(lld t) {cerr << t;}
void _print(double t) {cerr << t;}
void _print(ull t) {cerr << t;}

template <class T, class V> void _print(pair <T, V> p);
template <class T> void _print(vector <T> v);
template <class T> void _print(set <T> v);
template <class T, class V> void _print(map <T, V> v);
template <class T> void _print(multiset <T> v);
template <class T, class V> void _print(pair <T, V> p) {cerr << "{"; _print(p.ff); cerr << ","; _print(p.ss); cerr << "}";}
template <class T> void _print(vector <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
template <class T> void _print(set <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
template <class T> void _print(multiset <T> v) {cerr << "[ "; for (T i : v) {_print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void _print(map <T, V> v) {cerr << "[ "; for (auto i : v) {_print(i); cerr << " ";} cerr << "]";}


void solve(){
    ll l, r;
    cin >> l >> r;

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

    for( ll i=l; i<=r; i++ ){
        if( (i != a) && (i != b) ){
            c = i;
            break;
        }
    }
    cout << a << " " << b << " " << c << endl;
}


int main()
{
#ifndef ONLINE_JUDGE
    freopen("error.txt" , "w" , stderr );
    freopen("input.txt", "r" , stdin );
    freopen("output.txt", "w" , stdout );
#endif

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