This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<cstdio>
int main()
{
int Q;
scanf("%d",&Q);
while(Q--)
{
long long X,L,N,K,T,C;
scanf("%lld%lld%lld",&X,&L,&N);
X=X-1;
T=(L+2*N-1)/(2*N);
K=T*(2*N);
for(C=0;X>0&&T>=0;X>>=1,T--)C^=X&1;
printf("%lld\n",K+C);
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |