提出 #52343284

---

ソースコード 拡げる

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

Int f(Int b)
{
    Int t = 1LL;
    while (t <= b)
    {
        t <<= 1;
    }
    return t;
}

Int g(Int n){
    Int res = 0;
    while(n > 0){
        if(n % 2 == 0){
            res++;
            n /= 2;
        } else {
            break;
        }
    }
    return res;
}

Int cnt(Int bit)
{
    Int res = 0;
    Int crt = 1LL;
    while (crt <= bit)
    {
        res += ((crt & bit) != 0);
        crt = (crt << 1LL);
    }
    return res;
}

int main()
{
    Int l, r;
    cin >> l >> r;
    vector<pair<Int, Int>> ans;
    Int crt = l;
    while (crt < r)
    {

        if(crt == 0){
            Int t = 1LL;
            while((t << 1LL) <= r){
                t = (t << 1LL);
            }
            ans.push_back({0, t});
            crt = t;
            continue;
        }
        Int p = g(crt);
        Int maxi = -1;
        for(Int i = p; i >= 0; --i){
            Int x = crt / powl(2LL, i);
            Int nl = powl(2LL, i) * (x + 1);
            if(nl > r) continue;
            maxi = max(maxi, nl);
        }
        ans.push_back({crt, maxi});
        crt = maxi;
    }

    cout << ans.size() << endl;
    for (auto [a, b] : ans)
    {
        cout << a << " " << b << endl;
    }
}

提出情報

ジャッジ結果