| ID | Problem Show tags Hide tags | AC / Tried | Difficulty | |
|---|---|---|---|---|
| 4081 | P822F Madness | 0 / 0 | (None) | |
| 4076 | P825E Minimal Labels | 0 / 0 | (None) | |
| 4074 | P825G Tree Queries | 0 / 0 | (None) | |
| 4070 | P827D Best Edge Weight | 0 / 0 | (None) | |
| 4054 | P832D Misha, Grisha and Underground | 0 / 0 | (None) | |
| 4040 | P835F Roads in the Kingdom | 0 / 0 | (None) | |
| 4031 | P838B Diverging Directions | 0 / 0 | (None) | |
| 4024 | P839C Journey | 0 / 0 | (None) | |
| 4020 | P840B Leha and another game about graph | 0 / 0 | (None) | |
| 4012 | P842C Ilya And The Tree | 0 / 0 | (None) | |
| 4010 | P842E Nikita and game | 0 / 0 | (None) | |
| 4009 | P843A Sorting by Subsequences | 0 / 0 | (None) | |
| 4007 | P843C Upgrading Tree | 0 / 0 | (None) | |
| 3996 | P845G Shortest Path Problem? | 0 / 0 | (None) | |
| 3991 | P846E Chemistry in Berland | 0 / 0 | (None) | |
| 3981 | P847I Noise Level | 0 / 0 | (None) | |
| 3978 | P847L Berland SU Computer Network | 0 / 0 | (None) | |
| 3953 | P852I Dating | 0 / 0 | (None) | |
| 3939 | P855G Harry Vs Voldemort | 0 / 0 | (None) | |
| 3927 | P858F Wizard's Tour | 0 / 0 | (None) |
By signing up a 追梦算法网 universal account, you can submit code and join discussions in all online judging services provided by us.