ID 题目 显示标签 隐藏标签 AC / 尝试 难度
4989 P891D   Sloth 0 / 0 10
4983 P893C   Rumor 0 / 0 4
4969 P896A   Nephren gives a riddle 0 / 0 5
4936 P901C   Bipartite Segments 0 / 0 8
4935 P901D   Weighting a Tree 0 / 0 10
4932 P902B   Coloring a Tree 0 / 0 4
4905 P909E   Coprocessor 0 / 0 6
4903 P910A   The Way to Home 0 / 0 3
4895 P911F   Tree Destruction 0 / 0 9
4889 P912E   Prime Gift 0 / 0 9
4869 P915D   Almost Acyclic Graph 0 / 0 8
4859 P917B   MADMAX 0 / 0 5
4850 P919D   Substring 0 / 0 5
4845 P920C   Swap Adjacent Elements 0 / 0 4
4843 P920E   Connected Components? 0 / 0 7
4764 P930A   Peculiar apple-tree 0 / 0 5
4755 P932B   Recursive Queries 0 / 0 4
4738 P935E   Fafa and Ancient Mathematics 0 / 0 8
4735 P936B   Sleepy Game 0 / 0 7
4720 P939D   Love Rescue 0 / 0 5
4704 P948A   Protect Sheep 0 / 0 3
4701 P949C   Data Center Maintenance 0 / 0 6
4685 P954D   Fight Against Traffic 0 / 0 5
4668 P958B2   Maximum Control (medium) 0 / 0 8
4638 P960E   Alternating Tree 0 / 0 8
4622 P962F   Simple Cycles Edges 0 / 0 9
4619 P963B   Destruction of a Tree 0 / 0 7
4592 P977D   Divide by three, multiply by two 0 / 0 4
4591 P977E   Cyclic Components 0 / 0 5
4580 P979C   Kuro and Walking Route 0 / 0 5
4561 P982C   Cut 'em all! 0 / 0 5
4558 P982F   The Meeting Place Cannot Be Changed 0 / 0 10
4541 P986C   AND Graph 0 / 0 9
4518 P990F   Flow Control 0 / 0 9
4478 P999E   Reachability from the Capital 0 / 0 7
4472 P1000E   We Need More Bosses 0 / 0 7
4427 P1005F   Berland and the Shortest Paths 0 / 0 7
4422 P1006E   Military Problem 0 / 0 5
4403 P1010D   Mars rover 0 / 0 7
4397 P1012B   Chemical table 0 / 0 6
4378 P1016F   Road Projects 0 / 0 10
4362 P1020B   Badge 0 / 0 3
4356 P1023F   Mobile Phone Network 0 / 0 10
4338 P1027D   Mouse Hunt 0 / 0 5
4336 P1027F   Session in BSU 0 / 0 9
4300 P1033A   King Escape 0 / 0 3
4296 P1033E   Hidden Bipartite Graph 0 / 0 10
4282 P1036G   Sources and Sinks 0 / 0 10
4278 P1037D   Valid BFS? 0 / 0 5
4269 P1038E   Maximum Matching 0 / 0 9

分类

试试手气

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