Please subscribe to the official Codeforces channel in Telegram via the link ×

GP of Poland

Revision en1, by rng_58, 2018-04-08 18:32:59

Since nobody posts it, I do.

C: Can we solve it faster than ?

B: Is there a simple way to solve this? We want to count the number of integers that appear odd number of times in a given range. To do this, we can use bitset for frequent numbers and sweepline + data structure for rare numbers, but it looked much harder than some other tasks...

Tags opencup, snarknews


  Rev. Lang. By When Δ Comment
en1 English rng_58 2018-04-08 18:32:59 383 Initial revision (published)