Problem: 2057C - Trip to the Olympiad
Language: C++23 (GCC 14-64, msys2)

Previous submission (verdict: Wrong answer on test 1):
/*******************************************
 @b |I|s|t|i|a|q|u|e| |A|h|m|e|d| |A|r|i|k|
********************************************/
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define static_assert(...) ;
#include <tr2/dynamic_bitset>
using u_bitset = tr2::dynamic_bitset<__uint128_t>;
using l_bitset = tr2::dynamic_bitset<__int128_t>;
void __print(int x) { cerr << x; }
#define bigll __int128_t
#define bigull __uint128_t
#define ll int_fast64_t
#define ull uint_fast64_t
#define ld long double
#define pi acos(-1)
#define set_bits __builtin_popcountll
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define IOS                  \
    ios::sync_with_stdio(0); \
    cin.tie(0);              \
    cout.tie(0);
#define FileIO                        \
    freopen("input.txt", "r", stdin); \
    freopen("output.txt", "w", stdout)
///@b decltype and const
const int MOD = 1e9 + 7, dx[] = {1, 0, -1, 0, 1, -1, -1, 1}, dy[] = {0, 1, 0, -1, 1, 1, -1, -1};
///@b debug
struct _
{
    ios_base::Init i;
    _()
    {
        cin.sync_with_stdio(0);
        cin.tie(0);
        cout << fixed << setprecision(10);
    }
} ___;
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 T, typename V>
void __print(const pair<T, V> &x)
{
    cerr << '{';
    __print(x.first);
    cerr << ',';
    __print(x.second);
    cerr << '}';
}
template <typename T>
void __print(const T &x)
{
    int f = 0;
    cerr << '{';
    for (auto &i : x)
        cerr << (f++ ? "," : ""), __print(i);
    cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V>
void _print(T t, V... v)
{
    __print(t);
    if (sizeof...(v))
        cerr << ", ";
    _print(v...);
}
#ifndef ONLINE_JUDGE
#define debug(x...)               \
    cerr << "[" << #x << "] = ["; \
    _print(x)
#else
#define debug(x...)
#endif

template <typename p, typename q>
using ht = gp_hash_table<p, q>;

///@b PBDS
// template <typename T>
// using o_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// template <typename T>
// using o_set_g = tree<T, null_type, greater<T>, rb_tree_tag, tree_order_statistics_node_update>;
// template <typename T>
// using o_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;
// template <typename T>
// using o_multiset_g = tree<T, null_type, greater_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;

void mxTrioXor(ll l, ll r)
{
    array<ll, 3> ans = {0, 0, 0};
    ll mx = 0;
    for (ll i = l; i <= r; i++)
    {
        for (ll j = i + 1; j <= r; j++)
        {
            for (ll k = j + 1; k <= r; k++)
            {
                if ((i ^ j ^ k) > mx)
                {
                    mx = i ^ j ^ k;
                    ans = {i, j, k};
                }
            }
        }
    }

    for (ll i = l; i <= r; i++)
    {
        for (ll j = i + 1; j <= r; j++)
        {
            for (ll k = j + 1; k <= r; k++)
            {
                if ((i ^ j ^ k) == mx)
                {
                    cout << i << " " << j << " " << k << endl;
                }
            }
        }
    }
    cout << mx << "\n";
}

inline void solve()
{
    ll l, r;
    cin >> l >> r;
    bitset<32> b(l ^ r), rbit(r);
    bitset<32> ans;
    ll msb = 0;
    for (ll i = 31; i >= 0; i--)
    {
        if (b[i])
        {
            msb = i;
            break;
        }
    }
    for (ll i = msb - 1; i >= 0; i--)
    {
        ans[i] = 1;
    }
    ull tmp = ans.to_ullong();
    for (ll i = l; i <= r; i++)
    {
        if (i != tmp and i != tmp + 1)
        {
            cout << tmp << " " << tmp + 1 << " " << i << "\n";
            return;
        }
    }
}

auto main() -> int32_t
{
    IOS;
    int t = 1, cs = 1;
    cin >> t;
    while (t--)
    {
        solve();
    }

    return 0;
}

Submission (verdict: Wrong answer on test 1):
/*******************************************
 @b |I|s|t|i|a|q|u|e| |A|h|m|e|d| |A|r|i|k|
********************************************/
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define static_assert(...) ;
#include <tr2/dynamic_bitset>
using u_bitset = tr2::dynamic_bitset<__uint128_t>;
using l_bitset = tr2::dynamic_bitset<__int128_t>;
void __print(int x) { cerr << x; }
#define bigll __int128_t
#define bigull __uint128_t
#define ll int_fast64_t
#define ull uint_fast64_t
#define ld long double
#define pi acos(-1)
#define set_bits __builtin_popcountll
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define IOS                  \
    ios::sync_with_stdio(0); \
    cin.tie(0);              \
    cout.tie(0);
#define FileIO                        \
    freopen("input.txt", "r", stdin); \
    freopen("output.txt", "w", stdout)
///@b decltype and const
const int MOD = 1e9 + 7, dx[] = {1, 0, -1, 0, 1, -1, -1, 1}, dy[] = {0, 1, 0, -1, 1, 1, -1, -1};
///@b debug
struct _
{
    ios_base::Init i;
    _()
    {
        cin.sync_with_stdio(0);
        cin.tie(0);
        cout << fixed << setprecision(10);
    }
} ___;
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 T, typename V>
void __print(const pair<T, V> &x)
{
    cerr << '{';
    __print(x.first);
    cerr << ',';
    __print(x.second);
    cerr << '}';
}
template <typename T>
void __print(const T &x)
{
    int f = 0;
    cerr << '{';
    for (auto &i : x)
        cerr << (f++ ? "," : ""), __print(i);
    cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V>
void _print(T t, V... v)
{
    __print(t);
    if (sizeof...(v))
        cerr << ", ";
    _print(v...);
}
#ifndef ONLINE_JUDGE
#define debug(x...)               \
    cerr << "[" << #x << "] = ["; \
    _print(x)
#else
#define debug(x...)
#endif

template <typename p, typename q>
using ht = gp_hash_table<p, q>;

///@b PBDS
// template <typename T>
// using o_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// template <typename T>
// using o_set_g = tree<T, null_type, greater<T>, rb_tree_tag, tree_order_statistics_node_update>;
// template <typename T>
// using o_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;
// template <typename T>
// using o_multiset_g = tree<T, null_type, greater_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;

void mxTrioXor(ll l, ll r)
{
    array<ll, 3> ans = {0, 0, 0};
    ll mx = 0;
    for (ll i = l; i <= r; i++)
    {
        for (ll j = i + 1; j <= r; j++)
        {
            for (ll k = j + 1; k <= r; k++)
            {
                if ((i ^ j ^ k) > mx)
                {
                    mx = i ^ j ^ k;
                    ans = {i, j, k};
                }
            }
        }
    }

    for (ll i = l; i <= r; i++)
    {
        for (ll j = i + 1; j <= r; j++)
        {
            for (ll k = j + 1; k <= r; k++)
            {
                if ((i ^ j ^ k) == mx)
                {
                    cout << i << " " << j << " " << k << endl;
                }
            }
        }
    }
    cout << mx << "\n";
}

inline void solve()
{
    ll l, r;
    cin >> l >> r;
    bitset<32> b(l ^ r), rbit(r);
    bitset<32> ans;
    ll mx = (1ll << 30);
    while (mx > r)
    {
        mx >>= 1;
    }
    for (ll i = l; i <= r; i++)
    {
        if (i != mx and i != (mx - 1))
        {
            cout << mx << " " << mx - 1 << " " << i << "\n";
            return;
        }
    }
}

auto main() -> int32_t
{
    IOS;
    int t = 1, cs = 1;
    cin >> t;
    while (t--)
    {
        solve();
    }

    return 0;
}