ID 题目 显示标签 隐藏标签 AC / 尝试 难度
5147 P780E   Underground Lab 0 / 0 7
5131 P786A   Berzerk 0 / 0 7
5128 P786D   Rap God 0 / 0 10
5123 P788B   Weird journey 0 / 0 7
5122 P788C   The Great Mixing 0 / 0 8
5109 P793B   Igor and his way to work 0 / 0 5
5106 P793E   Problem of offices 0 / 0 10
5100 P794D   Labelling Cities 0 / 0 9
5093 P796D   Police Stations 0 / 0 7
5087 P797D   Broken BST 0 / 0 7
5061 P802J   Send the Fool Further! (easy) 0 / 0 4
5059 P802L   Send the Fool Further! (hard) 0 / 0 9
5046 P804C   Ice cream coloring 0 / 0 8
5045 P804D   Expected diameter of a tree 0 / 0 9
5043 P804F   Fake bullions 0 / 0 10
5021 P811D   Vladik and Favorite Game 0 / 0 7
5016 P812D   Sagheer and Kindergarten 0 / 0 10
5012 P813C   The Tag Game 0 / 0 5
5005 P814D   An overnight dance in discotheque 0 / 0 7
4973 P821D   Okabe and City 0 / 0 8
4966 P822F   Madness 0 / 0 9
4961 P825E   Minimal Labels 0 / 0 8
4959 P825G   Tree Queries 0 / 0 9
4955 P827D   Best Edge Weight 0 / 0 10
4939 P832D   Misha, Grisha and Underground 0 / 0 6
4925 P835F   Roads in the Kingdom 0 / 0 9
4916 P838B   Diverging Directions 0 / 0 7
4909 P839C   Journey 0 / 0 5
4905 P840B   Leha and another game about graph 0 / 0 7
4897 P842C   Ilya And The Tree 0 / 0 7
4895 P842E   Nikita and game 0 / 0 10
4894 P843A   Sorting by Subsequences 0 / 0 4
4892 P843C   Upgrading Tree 0 / 0 10
4881 P845G   Shortest Path Problem? 0 / 0 8
4876 P846E   Chemistry in Berland 0 / 0 8
4866 P847I   Noise Level 0 / 0 6
4863 P847L   Berland SU Computer Network 0 / 0 9
4838 P852I   Dating 0 / 0 8
4824 P855G   Harry Vs Voldemort 0 / 0 10
4812 P858F   Wizard's Tour 0 / 0 8
4807 P859E   Desk Disorder 0 / 0 7
4804 P860E   Arkady and a Nobody-men 0 / 0 10
4802 P862B   Mahmoud and Ehab and the bipartiteness 0 / 0 4
4785 P864F   Cities Excursions 0 / 0 10
4766 P869D   The Overdosing Ubiquity 0 / 0 10
4760 P870E   Points, Lines and Ready-made Titles 0 / 0 8
4749 P875C   National Property 0 / 0 7
4740 P877D   Olya and Energy Drinks 0 / 0 7
4724 P883G   Orientation of Edges 0 / 0 6
4715 P884C   Bertown Subway 0 / 0 5
4688 P891D   Sloth 0 / 0 10
4682 P893C   Rumor 0 / 0 4
4668 P896A   Nephren gives a riddle 0 / 0 5
4642 P901C   Bipartite Segments 0 / 0 8
4641 P901D   Weighting a Tree 0 / 0 10
4638 P902B   Coloring a Tree 0 / 0 4
4611 P909E   Coprocessor 0 / 0 6
4609 P910A   The Way to Home 0 / 0 3
4601 P911F   Tree Destruction 0 / 0 9
4595 P912E   Prime Gift 0 / 0 9
4575 P915D   Almost Acyclic Graph 0 / 0 8
4565 P917B   MADMAX 0 / 0 5
4556 P919D   Substring 0 / 0 5
4551 P920C   Swap Adjacent Elements 0 / 0 4
4549 P920E   Connected Components? 0 / 0 7
4493 P930A   Peculiar apple-tree 0 / 0 5
4484 P932B   Recursive Queries 0 / 0 4
4467 P935E   Fafa and Ancient Mathematics 0 / 0 8
4464 P936B   Sleepy Game 0 / 0 7
4449 P939D   Love Rescue 0 / 0 5
4433 P948A   Protect Sheep 0 / 0 3
4430 P949C   Data Center Maintenance 0 / 0 6
4414 P954D   Fight Against Traffic 0 / 0 5
4397 P958B2   Maximum Control (medium) 0 / 0 8
4375 P960E   Alternating Tree 0 / 0 8
4359 P962F   Simple Cycles Edges 0 / 0 9
4356 P963B   Destruction of a Tree 0 / 0 7
4329 P977D   Divide by three, multiply by two 0 / 0 4
4328 P977E   Cyclic Components 0 / 0 5
4317 P979C   Kuro and Walking Route 0 / 0 5
4298 P982C   Cut 'em all! 0 / 0 5
4295 P982F   The Meeting Place Cannot Be Changed 0 / 0 10
4278 P986C   AND Graph 0 / 0 9
4255 P990F   Flow Control 0 / 0 9
4215 P999E   Reachability from the Capital 0 / 0 7
4209 P1000E   We Need More Bosses 0 / 0 7
4164 P1005F   Berland and the Shortest Paths 0 / 0 7
4159 P1006E   Military Problem 0 / 0 5
4140 P1010D   Mars rover 0 / 0 7
4134 P1012B   Chemical table 0 / 0 6
4115 P1016F   Road Projects 0 / 0 10
4099 P1020B   Badge 0 / 0 3
4093 P1023F   Mobile Phone Network 0 / 0 10
4081 P1027D   Mouse Hunt 0 / 0 5
4079 P1027F   Session in BSU 0 / 0 9
4043 P1033A   King Escape 0 / 0 3
4039 P1033E   Hidden Bipartite Graph 0 / 0 10
4025 P1036G   Sources and Sinks 0 / 0 10
4021 P1037D   Valid BFS? 0 / 0 5
4012 P1038E   Maximum Matching 0 / 0 9

分类

手气不错

根据当前过滤条件随机选择一道题