|
4883 |
P916C Jamie and Interesting Graph
|
0 / 0 |
普及
|
|
4879 |
P917B MADMAX
|
0 / 0 |
普及
|
|
4870 |
P919D Substring
|
0 / 0 |
普及
|
|
4868 |
P919F A Game With Numbers
|
0 / 0 |
CTSC
|
|
4863 |
P920E Connected Components?
|
0 / 0 |
提高
|
|
4835 |
P923F Public Service
|
0 / 0 |
CTSC
|
|
4809 |
P928C Dependency management
|
0 / 0 |
普及
|
|
4807 |
P930A Peculiar apple-tree
|
0 / 0 |
普及
|
|
4790 |
P933C A Colourful Prospect
|
0 / 0 |
CTSC
|
|
4778 |
P936B Sleepy Game
|
0 / 0 |
提高
|
|
4770 |
P938D Buy a Ticket
|
0 / 0 |
提高
|
|
4767 |
P938G Shortest Path Queries
|
0 / 0 |
CTSC
|
|
4766 |
P939A Love Triangle
|
0 / 0 |
普及-
|
|
4763 |
P939D Love Rescue
|
0 / 0 |
普及
|
|
4747 |
P948A Protect Sheep
|
0 / 0 |
普及-
|
|
4744 |
P949C Data Center Maintenance
|
0 / 0 |
普及
|
|
4728 |
P954D Fight Against Traffic
|
0 / 0 |
普及
|
|
4711 |
P958B2 Maximum Control (medium)
|
0 / 0 |
省选
|
|
4695 |
P959E Mahmoud and Ehab and the xor-MST
|
0 / 0 |
普及
|
|
4688 |
P960F Pathwalks
|
0 / 0 |
提高
|
|
4673 |
P962F Simple Cycles Edges
|
0 / 0 |
NOI
|
|
4649 |
P976D Degree Set
|
0 / 0 |
NOI
|
|
4647 |
P976F Minimal k-covering
|
0 / 0 |
NOI
|
|
4642 |
P977E Cyclic Components
|
0 / 0 |
普及
|
|
4623 |
P980F Cactus to Tree
|
0 / 0 |
CTSC
|
|
4612 |
P982C Cut 'em all!
|
0 / 0 |
普及
|
|
4609 |
P982F The Meeting Place Cannot Be Changed
|
0 / 0 |
CTSC
|
|
4606 |
P983C Elevator
|
0 / 0 |
NOI
|
|
4594 |
P986A Fair
|
0 / 0 |
普及
|
|
4592 |
P986C AND Graph
|
0 / 0 |
NOI
|
|
4589 |
P986F Oppa Funcan Style Remastered
|
0 / 0 |
CTSC
|
|
4577 |
P989C A Mist of Florescence
|
0 / 0 |
普及
|
|
4571 |
P990D Graph And Its Complement
|
0 / 0 |
普及
|
|
4544 |
P995E Number Clicker
|
0 / 0 |
CTSC
|
|
4529 |
P999E Reachability from the Capital
|
0 / 0 |
提高
|
|
4523 |
P1000E We Need More Bosses
|
0 / 0 |
提高
|
|
4492 |
P1003E Tree Constructing
|
0 / 0 |
提高
|
|
4478 |
P1005F Berland and the Shortest Paths
|
0 / 0 |
提高
|
|
4473 |
P1006E Military Problem
|
0 / 0 |
普及
|
|
4461 |
P1009D Relatively Prime Graph
|
0 / 0 |
普及
|
|
4458 |
P1009G Allowed Letters
|
0 / 0 |
NOI
|
|
4454 |
P1010D Mars rover
|
0 / 0 |
提高
|
|
4452 |
P1010F Tree
|
0 / 0 |
CTSC
|
|
4448 |
P1012B Chemical table
|
0 / 0 |
普及
|
|
4417 |
P1019C Sergey's problem
|
0 / 0 |
CTSC
|
|
4413 |
P1020B Badge
|
0 / 0 |
普及-
|
|
4407 |
P1023F Mobile Phone Network
|
0 / 0 |
CTSC
|
|
4395 |
P1027D Mouse Hunt
|
0 / 0 |
普及
|
|
4393 |
P1027F Session in BSU
|
0 / 0 |
NOI
|
|
4379 |
P1029E Tree with Small Distances
|
0 / 0 |
提高
|
|
4365 |
P1031F Familiar Operations
|
0 / 0 |
CTSC
|
|
4357 |
P1033A King Escape
|
0 / 0 |
普及-
|
|
4353 |
P1033E Hidden Bipartite Graph
|
0 / 0 |
CTSC
|
|
4335 |
P1037D Valid BFS?
|
0 / 0 |
普及
|
|
4334 |
P1037E Trips
|
0 / 0 |
省选
|
|
4326 |
P1038E Maximum Matching
|
0 / 0 |
NOI
|
|
4322 |
P1039C Network Safety
|
0 / 0 |
省选
|
|
4313 |
P1041E Tree Reconstruction
|
0 / 0 |
普及
|
|
4306 |
P1042F Leaf Sets
|
0 / 0 |
NOI
|
|
4292 |
P1045A Last chance
|
0 / 0 |
NOI
|
|
4290 |
P1045C Hyperspace Highways
|
0 / 0 |
省选
|
|
4272 |
P1051F The Shortest Statement
|
0 / 0 |
NOI
|
|
4261 |
P1055A Metro
|
0 / 0 |
普及-
|
|
4251 |
P1056D Decorate Apple Tree
|
0 / 0 |
普及
|
|
4248 |
P1056G Take Metro
|
0 / 0 |
CTSC
|
|
4226 |
P1061E Politics
|
0 / 0 |
CTSC
|
|
4221 |
P1062D Fun with Integers
|
0 / 0 |
普及
|
|
4219 |
P1062F Upgrading Cities
|
0 / 0 |
CTSC
|
|
4217 |
P1063B Labyrinth
|
0 / 0 |
普及
|
|
4209 |
P1065B Vasya and Isolated Vertices
|
0 / 0 |
普及-
|
|
4196 |
P1067B Multihedgehog
|
0 / 0 |
普及
|
|
4190 |
P1068C Colored Rooks
|
0 / 0 |
普及
|
|
4189 |
P1070A Find a Number
|
0 / 0 |
省选
|
|
4181 |
P1070I Privatization of Roads in Berland
|
0 / 0 |
NOI
|
|
4163 |
P1076D Edge Deletion
|
0 / 0 |
普及
|
|
4142 |
P1081D Maximum Distance
|
0 / 0 |
普及
|
|
4134 |
P1082D Maximum Diameter Graph
|
0 / 0 |
普及
|
|
4131 |
P1082G Petya and Graph
|
0 / 0 |
NOI
|
|
4077 |
P1091E New Year and the Acquaintance Estimation
|
0 / 0 |
NOI
|
|
4063 |
P1093D Beautiful Graph
|
0 / 0 |
普及
|
|
4054 |
P1095F Make It Connected
|
0 / 0 |
普及
|
|
4036 |
P1098C Construct a tree
|
0 / 0 |
NOI
|
|
4024 |
P1100E Andrew and Taxi
|
0 / 0 |
省选
|
|
4010 |
P1102F Elongated Matrix
|
0 / 0 |
提高
|
|
4007 |
P1103C Johnny Solving
|
0 / 0 |
CTSC
|
|
3999 |
P1105D Kilani and the Game
|
0 / 0 |
普及
|
|
3994 |
P1106D Lunar New Year and a Wander
|
0 / 0 |
普及
|
|
3986 |
P1107F Vasya and Endless Credits
|
0 / 0 |
CTSC
|
|
3978 |
P1108F MST Unification
|
0 / 0 |
提高
|
|
3959 |
P1111E Tree
|
0 / 0 |
NOI
|
|
3905 |
P1120D Power Tree
|
0 / 0 |
NOI
|
|
3887 |
P1131D Gourmet choice
|
0 / 0 |
提高
|
|
3871 |
P1133F1 Spanning Tree with Maximum Degree
|
0 / 0 |
普及
|
|
3870 |
P1133F2 Spanning Tree with One Fixed Degree
|
0 / 0 |
普及
|
|
3862 |
P1137C Museums Tour
|
0 / 0 |
NOI
|
|
3854 |
P1139C Edgy Trees
|
0 / 0 |
普及
|
|
3852 |
P1139E Maximize Mex
|
0 / 0 |
NOI
|
|
3836 |
P1141G Privatization of Roads in Treeland
|
0 / 0 |
普及
|
|
3831 |
P1142E Pink Floyd
|
0 / 0 |
CTSC
|
|
3822 |
P1144F Graph Without Long Directed Paths
|
0 / 0 |
普及
|