Comments
0

Solve atleast one problem
0

Can anyone please explain what this means: Here some x i < 0 , But Natasha can add for each par a sufficiently large number, multiple k , that x i became greater than zero, for 1011-E
On Gassa → Codeforces Marathon Round 2, 8 years ago
+16

Has the beginning time changed(+30 mins) ?
0

Auto comment: topic has been updated by monsij (previous revision, new revision, compare).
0

Efficient and easy segment trees by AI.Cash

Link: http://codeforces.me/blog/entry/18051
0

Ok!
-12

By the way can it manage n= 10^6?
0

Thanks dude!
+2

Thanks
0

Fortunate to have such a helpful community!
0

Thanks a ton!
0

Yes indeed.This problem can be solved using sqrt decomposition.
0

I think in the tutorial to Problem 907A — Masha and Bears, the point 4-->(Masha likes last car, so it's size is not more than 2·V3) must be (Masha likes last car, so it's size is not more than 2·Vm) . @veschii_nevstrui
0

I think it's given in the question that a tank in cell n can move to only cell n-1 except for 1 wherein it moves to 2
0

For problem C what if i throw bombs on all cells starting from last to first and then again in the 2nd cell.It gives n+1 as my answer.
0

Is it 13th of October or November?