Submission #45883653

---

Source Code Expand

import sys
sys.setrecursionlimit(30000)
t=int(input())

def calc(n,x,k):
    s=x*(2**k)
    e=x
    for _ in range(k):
        e=e*2+1
    if n < s:
        ret=0
    else:
        ret=min(n, e)-s+1
    return ret

def func(n,x,k):
    ret=0
    ret+=calc(n,x,k)

    for i in range(1, 100):
        if x == 1:
            if k-i < 0:
                ret+=1
            break
        if 1+i <= k:
            v=x^1
            ret+=calc(n, v, k-(1+i))
        x//=2

    return ret

for _ in range(t):
    n,x,k=map(int,input().split())
    if k == 0:
        print(1)
    else:
        print(func(n,x,k))

Submission Info

Judge Result