I don't know how it is possible today i received an email saying that my solutions to the problems 1530B,1530C,1530D matches the solutions of many participants but i didn't used any unfair means to solve the problems,I used Code chef compiler to solve the problems which i don't think make your codes public please help me regarding this and to whom i should report this to. i didn't lock all the solutions in the hope that the y will be locked in the end automatically but i am completely certain that nobody has copied my solution i was giving the competition alone and with full honesty please consider them these are my solutions which are plagued 122809137 122793497 122832273

I don't know how it is possible today i received an email saying that my solutions to the problems 1530B,1530C,1530D matches the solutions of many participants but i didn't used any unfair means to solve the problems,I used Codechef compiler to solve the problems which i dont't think make your codes public please help me regarding this and to whom i should report this to.

can anybody share the solution of easy version of potion with dp?

can someone please send the implementation of problem 2 (morning jogging).

thanks a lot for the approach

can C be done using priority queue?

Is this competition going to be ranked?

can you please tell me how did you get to the approach that we need 3 or more segments whose xor = xr? I am finding it a bit difficult in getting it.