by taking log to base 2
best part was the answer required a precision of only 0.01 so i could use ans = pow(2.0,log2(ans)) to get the solution! i did it exactly the way @retrograd said above. https://www.codechef.com/viewsolution/8156597
https://www.codechef.com/viewsolution/8164155
can someone please tell what is the mistake in this solution. I have tried several changes but nothing worked. Thanks in advance!
change p k and s to long long 
The Test Case 10 was out of constraints. What action was taken ??
there is a line where you have not put brackets. it should be (i-k)%2 not i-k%2
I know I should ask this as a question, but I do not have enough karma points, so I’m commenting it here.
I want to know how does codechef detect plagiarism as the following three codes from the SEPT15 long challenge seem exactly same to me:
problem CODECRCK:
https://www.codechef.com/viewsolution/8142078
https://www.codechef.com/viewsolution/8151690
https://www.codechef.com/viewsolution/8164233
In the above three codes, one thing that is to be noted is, the first one seemed manipulative to submit the solution the PYPY instead of PYTH. The second and third codes were detected by the scanner and the first one was not as the ratings of these users suggest.
So, my question is don’t they consider laguages/ implementation with same syntax may have plagiarised codes, or it is just a mistake?
My second question is regarding these two codes, in which there is just one difference of variable name, and everything else is exactly the same:
https://www.codechef.com/viewsolution/8072373
https://www.codechef.com/viewsolution/8156642
What may be possible reason these codes got undetected? Isn’t it a setback for those who try real hard for 10 days and these people go undetected by their manipulations.
Codechef, please consider these maipulations too, this is really serious!!
1 Like
thanks a lot
1 Like