ID 题目 显示标签 隐藏标签 AC / 尝试 难度
4298 P891D   Sloth 0 / 0 10
4293 P893C   Rumor 0 / 0 4
4278 P896A   Nephren gives a riddle 0 / 0 5
4252 P901C   Bipartite Segments 0 / 0 8
4251 P901D   Weighting a Tree 0 / 0 10
4248 P902B   Coloring a Tree 0 / 0 4
4221 P909E   Coprocessor 0 / 0 6
4218 P910A   The Way to Home 0 / 0 3
4211 P911F   Tree Destruction 0 / 0 9
4205 P912E   Prime Gift 0 / 0 9
4185 P915D   Almost Acyclic Graph 1 / 2 8
4173 P917B   MADMAX 0 / 0 5
4164 P919D   Substring 0 / 0 5
4159 P920C   Swap Adjacent Elements 0 / 0 4
4157 P920E   Connected Components? 0 / 0 7
4101 P930A   Peculiar apple-tree 0 / 0 5
4092 P932B   Recursive Queries 0 / 0 4
4075 P935E   Fafa and Ancient Mathematics 0 / 0 8
4072 P936B   Sleepy Game 0 / 0 7
4057 P939D   Love Rescue 0 / 0 5
4041 P948A   Protect Sheep 0 / 0 3
4038 P949C   Data Center Maintenance 0 / 0 6
4023 P954D   Fight Against Traffic 0 / 0 5
4006 P958B2   Maximum Control (medium) 0 / 0 8
3984 P960E   Alternating Tree 0 / 0 8
3968 P962F   Simple Cycles Edges 0 / 0 9
3965 P963B   Destruction of a Tree 0 / 0 7
3938 P977D   Divide by three, multiply by two 0 / 0 4
3937 P977E   Cyclic Components 0 / 0 5
3926 P979C   Kuro and Walking Route 0 / 0 5
3907 P982C   Cut 'em all! 0 / 0 5
3904 P982F   The Meeting Place Cannot Be Changed 0 / 0 10
3887 P986C   AND Graph 0 / 0 9
3864 P990F   Flow Control 0 / 0 9
3824 P999E   Reachability from the Capital 0 / 0 7
3818 P1000E   We Need More Bosses 0 / 0 7
3773 P1005F   Berland and the Shortest Paths 0 / 0 7
3768 P1006E   Military Problem 0 / 0 5
3749 P1010D   Mars rover 0 / 0 7
3743 P1012B   Chemical table 0 / 0 6
3724 P1016F   Road Projects 0 / 0 10
3708 P1020B   Badge 0 / 0 3
3702 P1023F   Mobile Phone Network 0 / 0 10
3690 P1027D   Mouse Hunt 0 / 0 5
3688 P1027F   Session in BSU 0 / 0 9
3652 P1033A   King Escape 0 / 0 3
3648 P1033E   Hidden Bipartite Graph 0 / 0 10
3634 P1036G   Sources and Sinks 0 / 0 10
3630 P1037D   Valid BFS? 0 / 0 5
3621 P1038E   Maximum Matching 0 / 0 9

分类

试试手气

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