# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
7690 | gs13068 | CATS (NOI14_cats) | C++98 | 100 ms | 1088 KiB |
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=0;
scanf("%lld%lld%lld",&X,&L,&N);
X=X-1;
K=(L+2*N-1)/(2*N)*(2*N);
for(T=K/(2*N)+1;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... |