|
|
6086 |
CF893C
Rumor
|
0 / 0 |
(None) |
|
|
6070 |
CF896A
Nephren gives a riddle
|
0 / 0 |
(None) |
|
|
6041 |
CF901C
Bipartite Segments
|
0 / 0 |
(None) |
|
|
6040 |
CF901D
Weighting a Tree
|
0 / 0 |
(None) |
|
|
6037 |
CF902B
Coloring a Tree
|
0 / 0 |
(None) |
|
|
6007 |
CF909E
Coprocessor
|
0 / 0 |
(None) |
|
|
6005 |
CF910A
The Way to Home
|
0 / 0 |
(None) |
|
|
5996 |
CF911F
Tree Destruction
|
0 / 0 |
(None) |
|
|
5989 |
CF912E
Prime Gift
|
0 / 0 |
(None) |
|
|
5966 |
CF915D
Almost Acyclic Graph
|
0 / 0 |
(None) |
|
|
5955 |
CF917B
MADMAX
|
0 / 0 |
(None) |
|
|
5945 |
CF919D
Substring
|
0 / 0 |
(None) |
|
|
5940 |
CF920C
Swap Adjacent Elements
|
0 / 0 |
(None) |
|
|
5938 |
CF920E
Connected Components?
|
0 / 0 |
(None) |
|
|
5876 |
CF930A
Peculiar apple-tree
|
0 / 0 |
(None) |
|
|
5866 |
CF932B
Recursive Queries
|
0 / 0 |
(None) |
|
|
5846 |
CF935E
Fafa and Ancient Mathematics
|
0 / 0 |
(None) |
|
|
5842 |
CF936B
Sleepy Game
|
0 / 0 |
(None) |
|
|
5826 |
CF939D
Love Rescue
|
0 / 0 |
(None) |
|
|
5808 |
CF948A
Protect Sheep
|
0 / 0 |
(None) |
|
|
5805 |
CF949C
Data Center Maintenance
|
0 / 0 |
(None) |
|
|
5787 |
CF954D
Fight Against Traffic
|
0 / 0 |
(None) |
|
|
5769 |
CF958B2
Maximum Control (medium)
|
0 / 0 |
(None) |
|
|
5743 |
CF960E
Alternating Tree
|
0 / 0 |
(None) |
|
|
5726 |
CF962F
Simple Cycles Edges
|
0 / 0 |
(None) |
|
|
5722 |
CF963B
Destruction of a Tree
|
0 / 0 |
(None) |
|
|
5693 |
CF977D
Divide by three, multiply by two
|
0 / 0 |
(None) |
|
|
5692 |
CF977E
Cyclic Components
|
0 / 0 |
(None) |
|
|
5680 |
CF979C
Kuro and Walking Route
|
0 / 0 |
(None) |
|
|
5659 |
CF982C
Cut 'em all!
|
0 / 0 |
(None) |
|
|
5655 |
CF982F
The Meeting Place Cannot Be Changed
|
0 / 0 |
(None) |
|
|
5637 |
CF986C
AND Graph
|
0 / 0 |
(None) |
|
|
5610 |
CF990F
Flow Control
|
0 / 0 |
(None) |
|
|
5566 |
CF999E
Reachability from the Capital
|
0 / 0 |
(None) |
|
|
5560 |
CF1000E
We Need More Bosses
|
0 / 0 |
(None) |
|
|
5509 |
CF1005F
Berland and the Shortest Paths
|
0 / 0 |
(None) |
|
|
5504 |
CF1006E
Military Problem
|
0 / 0 |
(None) |
|
|
5483 |
CF1010D
Mars rover
|
0 / 0 |
(None) |
|
|
5476 |
CF1012B
Chemical table
|
0 / 0 |
(None) |
|
|
5455 |
CF1016F
Road Projects
|
0 / 0 |
(None) |
|
|
5438 |
CF1020B
Badge
|
0 / 0 |
(None) |
|
|
5431 |
CF1023F
Mobile Phone Network
|
0 / 0 |
(None) |
|
|
5418 |
CF1027D
Mouse Hunt
|
0 / 0 |
(None) |
|
|
5416 |
CF1027F
Session in BSU
|
0 / 0 |
(None) |
|
|
5375 |
CF1033A
King Escape
|
0 / 0 |
(None) |
|
|
5371 |
CF1033E
Hidden Bipartite Graph
|
0 / 0 |
(None) |
|
|
5355 |
CF1036G
Sources and Sinks
|
0 / 0 |
(None) |
|
|
5351 |
CF1037D
Valid BFS?
|
0 / 0 |
(None) |
|
|
5341 |
CF1038E
Maximum Matching
|
0 / 0 |
(None) |
|
|
5337 |
CF1039C
Network Safety
|
0 / 0 |
(None) |
|
|
5319 |
CF1042F
Leaf Sets
|
0 / 0 |
(None) |
|
|
5309 |
CF1044B
Intersecting Subtrees
|
0 / 0 |
(None) |
|
|
5300 |
CF1045C
Hyperspace Highways
|
0 / 0 |
(None) |
|
|
5258 |
CF1056D
Decorate Apple Tree
|
0 / 0 |
(None) |
|
|
5252 |
CF1057A
Bmail Computer Network
|
0 / 0 |
(None) |
|
|
5239 |
CF1060E
Sergey and Subway
|
0 / 0 |
(None) |
|
|
5225 |
CF1062D
Fun with Integers
|
0 / 0 |
(None) |
|
|
5223 |
CF1062E
Company
|
0 / 0 |
(None) |
|
|
5222 |
CF1062F
Upgrading Cities
|
0 / 0 |
(None) |
|
|
5209 |
CF1065D
Three Pieces
|
0 / 0 |
(None) |
|
|
5207 |
CF1065F
Up and Down the Tree
|
0 / 0 |
(None) |
|
|
5197 |
CF1067B
Multihedgehog
|
0 / 0 |
(None) |
|
|
5167 |
CF1073F
Choosing Two Paths
|
0 / 0 |
(None) |
|
|
5054 |
CF1092E
Minimal Diameter Forest
|
0 / 0 |
(None) |
|
|
5053 |
CF1092F
Tree with Maximum Cost
|
0 / 0 |
(None) |
|
|
5049 |
CF1093D
Beautiful Graph
|
0 / 0 |
(None) |
|
|
5021 |
CF1098A
Sum in the tree
|
0 / 0 |
(None) |
|
|
5019 |
CF1098C
Construct a tree
|
0 / 0 |
(None) |
|
|
5011 |
CF1099F
Cookies
|
0 / 0 |
(None) |
|
|
5006 |
CF1100E
Andrew and Taxi
|
0 / 0 |
(None) |
|
|
5000 |
CF1101D
GCD Counting
|
0 / 0 |
(None) |
|
|
4987 |
CF1103C
Johnny Solving
|
0 / 0 |
(None) |
|
|
4978 |
CF1105D
Kilani and the Game
|
0 / 0 |
(None) |
|
|
4973 |
CF1106D
Lunar New Year and a Wander
|
0 / 0 |
(None) |
|
|
4933 |
CF1111E
Tree
|
0 / 0 |
(None) |
|
|
4888 |
CF1118F1
Tree Cutting (Easy Version)
|
0 / 0 |
(None) |
|
|
4887 |
CF1118F2
Tree Cutting (Hard Version)
|
0 / 0 |
(None) |
|
|
4874 |
CF1120D
Power Tree
|
0 / 0 |
(None) |
|
|
4859 |
CF1130C
Connect
|
0 / 0 |
(None) |
|
|
4853 |
CF1131D
Gourmet choice
|
0 / 0 |
(None) |
|
|
4844 |
CF1132E
Knapsack
|
0 / 0 |
(None) |
|
|
4834 |
CF1133F2
Spanning Tree with One Fixed Degree
|
0 / 0 |
(None) |
|
|
4817 |
CF1139C
Edgy Trees
|
0 / 0 |
(None) |
|
|
4797 |
CF1141G
Privatization of Roads in Treeland
|
0 / 0 |
(None) |
|
|
4795 |
CF1142B
Lynyrd Skynyrd
|
0 / 0 |
(None) |
|
|
4788 |
CF1143C
Queen
|
0 / 0 |
(None) |
|
|
4782 |
CF1144F
Graph Without Long Directed Paths
|
0 / 0 |
(None) |
|
|
4768 |
CF1146D
Frog Jumping
|
0 / 0 |
(None) |
|
|
4760 |
CF1147D
Palindrome XOR
|
0 / 0 |
(None) |
|
|
4730 |
CF1152B
Neko Performs Cat Furrier Transform
|
0 / 0 |
(None) |
|
|
4727 |
CF1152E
Neko and Flashback
|
0 / 0 |
(None) |
|
|
4720 |
CF1153D
Serval and Rooted Tree
|
0 / 0 |
(None) |
|
|
4702 |
CF1156B
Ugly Pairs
|
0 / 0 |
(None) |
|
|
4699 |
CF1156D
0-1-Tree
|
0 / 0 |
(None) |
|
|
4684 |
CF1158C
Permutation recovery
|
0 / 0 |
(None) |
|
|
4649 |
CF1167C
News Distribution
|
0 / 0 |
(None) |
|
|
4624 |
CF1172B
Nauuo and Circle
|
0 / 0 |
(None) |
|
|
4604 |
CF1175E
Minimal Segment Cover
|
0 / 0 |
(None) |
|
|
4597 |
CF1176D
Recover it!
|
0 / 0 |
(None) |
|
|
4596 |
CF1176E
Cover it!
|
0 / 0 |
(None) |
