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

Editorial + some challenges will be published soon. That's what they said

Some tips here, I am pretty sure that the editorial will be published sooner or later.

Div2-A: Simple logic, just check whether there are '0' in the string, if yes, add one to the current counter and update the max counter, if no, set current counter to zero.

Div2-B: You've already submitted an AC solution so I am skipping it.

Div2-C: If you don't have a idea what DFS is you better go learn it first.

Key points: 1. When can't you split edge uv into the two distinct union? 2. If you can, how to separate the points to the two players?

I haven't checked out others' solutions yet, but mine focuses on finding each points' depth.

Div2-D: The tag pretty much revealed everything: Chinese Remainder Theorem (Oh god damn it, I keep forgetting the core of it even I keep encountering it)

Go Google if you know nothing about it, it is related to co-prime of the ancient numbers.

The question could be simplified after you understood the theory.

Div2-E: Tag: dynamic programming

Tip for the dp variables: Consider that you have to print all of the PARTIAL SUM (Not quite sure if this is the word) of the sum k.

I am just a Div2 pleb so I haven't get my hands on Div1 questions yet...

I will make an update if I solved them before they published the editorial.

Why is there this many down votes? I asked for Editorials only right? :(