Tutorial is loading...

Tutorial is loading...

Tutorial is loading...

Tutorial is loading...

Tutorial is loading...

Tutorial is loading...

Tutorial is loading...

Tutorial is loading...

# | User | Rating |
---|---|---|

1 | tourist | 3686 |

2 | LHiC | 3336 |

3 | wxhtxdy | 3329 |

4 | Benq | 3311 |

5 | Um_nik | 3301 |

6 | V--o_o--V | 3275 |

7 | Radewoosh | 3268 |

8 | yutaka1999 | 3190 |

9 | ainta | 3180 |

10 | Petr | 3115 |

# | User | Contrib. |
---|---|---|

1 | Errichto | 193 |

2 | Radewoosh | 184 |

3 | rng_58 | 165 |

4 | PikMike | 163 |

5 | Vovuh | 159 |

6 | 300iq | 153 |

6 | majk | 153 |

8 | Um_nik | 148 |

8 | Petr | 148 |

10 | neal | 144 |

Tutorial is loading...

Tutorial is loading...

Tutorial is loading...

Tutorial is loading...

Tutorial is loading...

Tutorial is loading...

Tutorial is loading...

Tutorial is loading...

Tutorial of Technocup 2019 - Elimination Round 4

Tutorial of Technocup 2019 - Elimination Round 4

↑

↓

Codeforces (c) Copyright 2010-2019 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jul/22/2019 03:17:18 (f2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|

Thanks for fast editorial

so fast

I want to ask questions about the solution F:the 2

^{n}polynomials,is it should ben^{2}polynomials?2

^{n}since the inclusion-exclusion formula is used in the proof. But it is only the proof that the main function is a polynomial, we don't need to actually compute all these 2^{n}summands.Out of curiosity, may I ask problemsetters about their views to criticism on Div1C? There seems to be quite negative feedback to this problem. Do you think it is reasonable to appear in CF rounds? Do you think people's criticism make sense? Thanks.

I am not a setter of this problem, but I considered it to be OK when it was proposed. Perhaps it would be better if we didn't ask for a certificate.

But I still don't quite understand why it received such an amount of hate. There are problems which at first seem like handling a lot of corner cases without applying any specific idea, but if contestant thinks carefully before starting to write code, then he can reduce the length of this solution and the number of cases he needs to handle. I understand how this problem can be seen as a bad one if someone picks the first solution idea that comes to his mind and starts implementing it right away, but is it a good strategy on contests?

I didn't understand that in problem link 1085-B

how can we get this result : x= p*(n−p)/k ? Please Help.

can anyone please explain the following lines from "Minimum Diameter Tree" for dummies: "Note that the contribution to the sum on the right side of the inequality of the weight of each edge will be at least l−1, because any edge lies on ≥l−1 paths between the leaves of the tree. So, ∑1≤i<j≤ldistaiaj≥(l−1)⋅∑e∈Eweighte=(l−1)⋅s"

I think there is mistake in B editorial. There is should be x = (nk + p^2) / p, not x = p * (n — p) / k.

can someone provide easier explanation for the problem div-2 D, or how they were able to get this approach