Comments
+8

In Neon's editorial of problem F, why is this condition met carry>=(carry+cp)/10? Thanks!
0

adedalic for the editorial of problem f how do you prove this part "It can be proven that any maximum flow algorithm that relies on augmenting paths will finish after O(v) iterations in this network"
-11

yes please
0

Thank you so much for the advice, I passed the problem with the same solution, but using arrays instead of vectors!
0

Errichto Hello, could you tell me why this submission for problem H is timing out? https://codeforces.me/gym/102644/submission/98991255