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>
long long X,L,N;
int F(long long A)
{
if(A>L)
{
X--;
if(X==0)
{
printf("%lld\n",A);
return 1;
}
return 0;
}
F(A+N+N);
F((A+N+N)^1);
}
int main()
{
int tcn;
scanf("%d",&tcn);
while(tcn--)
{
long long T;
scanf("%lld%lld%lld",&X,&L,&N);
for(T=0;!F(T);T^=1);
}
}
# | 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... |