ID 题目 显示标签 隐藏标签 AC / 尝试 难度
6090 P780E   Underground Lab 0 / 0 7
6074 P786A   Berzerk 0 / 0 7
6071 P786D   Rap God 0 / 0 10
6066 P788B   Weird journey 0 / 0 7
6065 P788C   The Great Mixing 0 / 0 8
6052 P793B   Igor and his way to work 0 / 0 5
6049 P793E   Problem of offices 0 / 0 10
6043 P794D   Labelling Cities 0 / 0 9
6036 P796D   Police Stations 0 / 0 7
6030 P797D   Broken BST 0 / 0 7
6004 P802J   Send the Fool Further! (easy) 0 / 0 4
6002 P802L   Send the Fool Further! (hard) 0 / 0 9
5989 P804C   Ice cream coloring 0 / 0 8
5988 P804D   Expected diameter of a tree 0 / 0 9
5986 P804F   Fake bullions 0 / 0 10
5964 P811D   Vladik and Favorite Game 0 / 0 7
5959 P812D   Sagheer and Kindergarten 0 / 0 10
5955 P813C   The Tag Game 0 / 0 5
5948 P814D   An overnight dance in discotheque 0 / 0 7
5916 P821D   Okabe and City 0 / 0 8
5909 P822F   Madness 0 / 0 9
5904 P825E   Minimal Labels 0 / 0 8
5902 P825G   Tree Queries 0 / 0 9
5898 P827D   Best Edge Weight 0 / 0 10
5882 P832D   Misha, Grisha and Underground 0 / 0 6
5868 P835F   Roads in the Kingdom 0 / 0 9
5859 P838B   Diverging Directions 0 / 0 7
5852 P839C   Journey 0 / 0 5
5848 P840B   Leha and another game about graph 0 / 0 7
5840 P842C   Ilya And The Tree 0 / 0 7
5838 P842E   Nikita and game 0 / 0 10
5837 P843A   Sorting by Subsequences 0 / 0 4
5835 P843C   Upgrading Tree 0 / 0 10
5824 P845G   Shortest Path Problem? 0 / 0 8
5819 P846E   Chemistry in Berland 0 / 0 8
5809 P847I   Noise Level 0 / 0 6
5806 P847L   Berland SU Computer Network 0 / 0 9
5781 P852I   Dating 0 / 0 8
5767 P855G   Harry Vs Voldemort 0 / 0 10
5755 P858F   Wizard's Tour 0 / 0 8
5750 P859E   Desk Disorder 0 / 0 7
5747 P860E   Arkady and a Nobody-men 0 / 0 10
5745 P862B   Mahmoud and Ehab and the bipartiteness 0 / 0 4
5728 P864F   Cities Excursions 0 / 0 10
5709 P869D   The Overdosing Ubiquity 0 / 0 10
5703 P870E   Points, Lines and Ready-made Titles 0 / 0 8
5692 P875C   National Property 0 / 0 7
5683 P877D   Olya and Energy Drinks 0 / 0 7
5667 P883G   Orientation of Edges 0 / 0 6
5658 P884C   Bertown Subway 0 / 0 5
5631 P891D   Sloth 0 / 0 10
5625 P893C   Rumor 0 / 0 4
5611 P896A   Nephren gives a riddle 0 / 0 5
5585 P901C   Bipartite Segments 0 / 0 8
5584 P901D   Weighting a Tree 0 / 0 10
5581 P902B   Coloring a Tree 0 / 0 4
5554 P909E   Coprocessor 0 / 0 6
5552 P910A   The Way to Home 0 / 0 3
5544 P911F   Tree Destruction 0 / 0 9
5538 P912E   Prime Gift 0 / 0 9
5518 P915D   Almost Acyclic Graph 0 / 0 8
5508 P917B   MADMAX 0 / 0 5
5499 P919D   Substring 0 / 0 5
5494 P920C   Swap Adjacent Elements 0 / 0 4
5492 P920E   Connected Components? 0 / 0 7
5436 P930A   Peculiar apple-tree 0 / 0 5
5427 P932B   Recursive Queries 0 / 0 4
5410 P935E   Fafa and Ancient Mathematics 0 / 0 8
5407 P936B   Sleepy Game 0 / 0 7
5392 P939D   Love Rescue 0 / 0 5
5376 P948A   Protect Sheep 0 / 0 3
5373 P949C   Data Center Maintenance 0 / 0 6
5357 P954D   Fight Against Traffic 0 / 0 5
5340 P958B2   Maximum Control (medium) 0 / 0 8
5318 P960E   Alternating Tree 0 / 0 8
5302 P962F   Simple Cycles Edges 0 / 0 9
5299 P963B   Destruction of a Tree 0 / 0 7
5272 P977D   Divide by three, multiply by two 0 / 0 4
5271 P977E   Cyclic Components 0 / 0 5
5260 P979C   Kuro and Walking Route 0 / 0 5
5241 P982C   Cut 'em all! 0 / 0 5
5238 P982F   The Meeting Place Cannot Be Changed 0 / 0 10
5221 P986C   AND Graph 0 / 0 9
5198 P990F   Flow Control 0 / 0 9
5158 P999E   Reachability from the Capital 0 / 0 7
5152 P1000E   We Need More Bosses 0 / 0 7
5107 P1005F   Berland and the Shortest Paths 0 / 0 7
5102 P1006E   Military Problem 0 / 0 5
5083 P1010D   Mars rover 0 / 0 7
5077 P1012B   Chemical table 0 / 0 6
5058 P1016F   Road Projects 0 / 0 10
5042 P1020B   Badge 0 / 0 3
5036 P1023F   Mobile Phone Network 0 / 0 10
5024 P1027D   Mouse Hunt 0 / 0 5
5022 P1027F   Session in BSU 0 / 0 9
4986 P1033A   King Escape 0 / 0 3
4982 P1033E   Hidden Bipartite Graph 0 / 0 10
4968 P1036G   Sources and Sinks 0 / 0 10
4964 P1037D   Valid BFS? 0 / 0 5
4955 P1038E   Maximum Matching 0 / 0 9

分类

试试手气

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