ID 题目 显示标签 隐藏标签 AC / 尝试 难度
4849 P780E   Underground Lab 0 / 0 7
4833 P786A   Berzerk 0 / 0 7
4830 P786D   Rap God 0 / 0 10
4825 P788B   Weird journey 0 / 0 7
4824 P788C   The Great Mixing 0 / 0 8
4811 P793B   Igor and his way to work 0 / 0 5
4808 P793E   Problem of offices 0 / 0 10
4802 P794D   Labelling Cities 0 / 0 9
4795 P796D   Police Stations 0 / 0 7
4789 P797D   Broken BST 0 / 0 7
4763 P802J   Send the Fool Further! (easy) 0 / 0 4
4761 P802L   Send the Fool Further! (hard) 0 / 0 9
4748 P804C   Ice cream coloring 0 / 0 8
4747 P804D   Expected diameter of a tree 0 / 0 9
4745 P804F   Fake bullions 0 / 0 10
4723 P811D   Vladik and Favorite Game 0 / 0 7
4718 P812D   Sagheer and Kindergarten 0 / 0 10
4714 P813C   The Tag Game 0 / 0 5
4707 P814D   An overnight dance in discotheque 0 / 0 7
4675 P821D   Okabe and City 0 / 0 8
4668 P822F   Madness 0 / 0 9
4663 P825E   Minimal Labels 0 / 0 8
4661 P825G   Tree Queries 0 / 0 9
4657 P827D   Best Edge Weight 0 / 0 10
4641 P832D   Misha, Grisha and Underground 0 / 0 6
4627 P835F   Roads in the Kingdom 0 / 0 9
4618 P838B   Diverging Directions 0 / 0 7
4611 P839C   Journey 0 / 0 5
4607 P840B   Leha and another game about graph 0 / 0 7
4599 P842C   Ilya And The Tree 0 / 0 7
4597 P842E   Nikita and game 0 / 0 10
4596 P843A   Sorting by Subsequences 0 / 0 4
4594 P843C   Upgrading Tree 0 / 0 10
4583 P845G   Shortest Path Problem? 0 / 0 8
4578 P846E   Chemistry in Berland 0 / 0 8
4568 P847I   Noise Level 0 / 0 6
4565 P847L   Berland SU Computer Network 0 / 0 9
4540 P852I   Dating 0 / 0 8
4526 P855G   Harry Vs Voldemort 0 / 0 10
4514 P858F   Wizard's Tour 0 / 0 8
4509 P859E   Desk Disorder 0 / 0 7
4506 P860E   Arkady and a Nobody-men 0 / 0 10
4504 P862B   Mahmoud and Ehab and the bipartiteness 0 / 0 4
4487 P864F   Cities Excursions 0 / 0 10
4468 P869D   The Overdosing Ubiquity 0 / 0 10
4462 P870E   Points, Lines and Ready-made Titles 0 / 0 8
4451 P875C   National Property 0 / 0 7
4442 P877D   Olya and Energy Drinks 0 / 0 7
4426 P883G   Orientation of Edges 0 / 0 6
4417 P884C   Bertown Subway 0 / 0 5
4390 P891D   Sloth 0 / 0 10
4384 P893C   Rumor 0 / 0 4
4370 P896A   Nephren gives a riddle 0 / 0 5
4344 P901C   Bipartite Segments 0 / 0 8
4343 P901D   Weighting a Tree 0 / 0 10
4340 P902B   Coloring a Tree 0 / 0 4
4313 P909E   Coprocessor 0 / 0 6
4311 P910A   The Way to Home 0 / 0 3
4303 P911F   Tree Destruction 0 / 0 9
4297 P912E   Prime Gift 0 / 0 9
4277 P915D   Almost Acyclic Graph 0 / 0 8
4267 P917B   MADMAX 0 / 0 5
4258 P919D   Substring 0 / 0 5
4253 P920C   Swap Adjacent Elements 0 / 0 4
4251 P920E   Connected Components? 0 / 0 7
4195 P930A   Peculiar apple-tree 0 / 0 5
4186 P932B   Recursive Queries 0 / 0 4
4169 P935E   Fafa and Ancient Mathematics 0 / 0 8
4166 P936B   Sleepy Game 0 / 0 7
4151 P939D   Love Rescue 0 / 0 5
4135 P948A   Protect Sheep 0 / 0 3
4132 P949C   Data Center Maintenance 0 / 0 6
4116 P954D   Fight Against Traffic 0 / 0 5
4099 P958B2   Maximum Control (medium) 0 / 0 8
4077 P960E   Alternating Tree 0 / 0 8
4061 P962F   Simple Cycles Edges 0 / 0 9
4058 P963B   Destruction of a Tree 0 / 0 7
4031 P977D   Divide by three, multiply by two 0 / 0 4
4030 P977E   Cyclic Components 0 / 0 5
4019 P979C   Kuro and Walking Route 0 / 0 5
4000 P982C   Cut 'em all! 0 / 0 5
3997 P982F   The Meeting Place Cannot Be Changed 0 / 0 10
3980 P986C   AND Graph 0 / 0 9
3957 P990F   Flow Control 0 / 0 9
3917 P999E   Reachability from the Capital 0 / 0 7
3911 P1000E   We Need More Bosses 0 / 0 7
3866 P1005F   Berland and the Shortest Paths 0 / 0 7
3861 P1006E   Military Problem 0 / 0 5
3842 P1010D   Mars rover 0 / 0 7
3836 P1012B   Chemical table 0 / 0 6
3817 P1016F   Road Projects 0 / 0 10
3801 P1020B   Badge 0 / 0 3
3795 P1023F   Mobile Phone Network 0 / 0 10
3783 P1027D   Mouse Hunt 0 / 0 5
3781 P1027F   Session in BSU 0 / 0 9
3745 P1033A   King Escape 0 / 0 3
3741 P1033E   Hidden Bipartite Graph 0 / 0 10
3727 P1036G   Sources and Sinks 0 / 0 10
3723 P1037D   Valid BFS? 0 / 0 5
3714 P1038E   Maximum Matching 0 / 0 9

分类

手气不错

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