Submission #46014595

---

Source Code Expand

// LUOGU_RID: 126497667
#include<bits/stdc++.h>
#define int long long
using namespace std;
int n;

int clac(int x,int d)
{
    if(d > __lg(n / x))
    {
        return 0;
    }
    int l = x << d,r = (x << d) + ((1ll << d) - 1);
    return min(r,n) - l + 1;
}

void solve()
{
    int x,m,ans = 0;
    cin >> n >> x >> m;
    for(int t = 0;(x >> t) >= 1 && t <= m;t++)
    {
        int y = x >> t;
        int k = m - t;
        if(t == 0)
        {
            ans += clac(x,k);
        }
        else
        {
            ans += clac(y,k);
            if(t < m)
            {
                ans -= clac(x >> (t - 1),m - t - 1);
            }
        }
    }
    cout << ans << '\n';
}

signed main()
{
    int T;
    cin >> T;
    while(T--)
    {
        solve();
    }
    return 0;
}

Submission Info

Judge Result