|
|
10335 |
CF1738F
Connectivity Addicts
|
0 / 0 |
(None) |
|
|
10267 |
CF1739D
Reset K Edges
|
0 / 0 |
(None) |
|
|
10190 |
CF1740E
Hanging Hearts
|
0 / 0 |
(None) |
|
|
10156 |
CF1740H
MEX Tree Manipulation
|
0 / 0 |
(None) |
|
|
10101 |
CF1741D
Masha and a Beautiful Tree
|
0 / 0 |
(None) |
|
|
9790 |
CF1746D
Paths on the Tree
|
0 / 0 |
(None) |
|
|
9635 |
CF1748E
Yet Another Array Counting Problem
|
0 / 0 |
(None) |
|
|
9557 |
CF1749F
Distance to the Path
|
0 / 0 |
(None) |
|
|
9090 |
CF1761E
Make It Connected
|
0 / 0 |
(None) |
|
|
9056 |
CF1761G
Centroid Guess
|
0 / 0 |
(None) |
|
|
9001 |
CF1762E
Tree Sum
|
0 / 0 |
(None) |
|
|
8912 |
CF1763F
Edge Queries
|
0 / 0 |
(None) |
|
|
8845 |
CF1764F
Doremy's Experimental Tree
|
0 / 0 |
(None) |
|
|
8524 |
CF1767E
Algebra Flash
|
0 / 0 |
(None) |
|
|
8512 |
CF1767F
Two Subtrees
|
0 / 0 |
(None) |
|
|
8390 |
CF1770E
Koxia and Tree
|
0 / 0 |
(None) |
|
|
8313 |
CF1771D
Hossam and (sub-)palindromic tree
|
0 / 0 |
(None) |
|
|
8290 |
CF1771F
Hossam and Range Minimum Query
|
0 / 0 |
(None) |
|
|
8268 |
CF1773B
BinCoin
|
0 / 0 |
(None) |
|
|
8102 |
CF1774E
Two Chess Pieces
|
0 / 0 |
(None) |
|
|
8067 |
CF1774G
Segment Covering
|
0 / 0 |
(None) |
|
|
7834 |
CF1776M
Parmigiana With Seafood
|
0 / 0 |
(None) |
|
|
7779 |
CF1777D
Score of a Tree
|
0 / 0 |
(None) |
|
|
7768 |
CF1777E
Edge Reverse
|
0 / 0 |
(None) |
|
|
7757 |
CF1777F
Comfortably Numb
|
0 / 0 |
(None) |
|
|
7701 |
CF1778E
The Tree Has Fallen!
|
0 / 0 |
(None) |
|
|
7690 |
CF1778F
Maximizing Root
|
0 / 0 |
(None) |
|
|
7623 |
CF1779F
Xorcerer's Stones
|
0 / 0 |
(None) |
|
|
7468 |
CF1781F
Bracket Insertion
|
0 / 0 |
(None) |
|
|
7457 |
CF1781G
Diverse Coloring
|
0 / 0 |
(None) |
|
|
7357 |
CF1783G
Weighed Tree Radius
|
0 / 0 |
(None) |
|
|
7179 |
CF1787G
Colorful Tree Again
|
0 / 0 |
(None) |
|
|
7091 |
CF1788F
XOR, Tree, and Queries
|
0 / 0 |
(None) |
|
|
6956 |
CF1790F
Timofey and Black-White Tree
|
0 / 0 |
(None) |
|
|
6657 |
CF1794E
Labeling the Tree with Distances
|
0 / 0 |
(None) |
|
|
6590 |
CF1795F
Blocking Chips
|
0 / 0 |
(None) |
|
|
6524 |
CF1796E
Colored Subgraphs
|
0 / 0 |
(None) |
|
|
6468 |
CF1797D
Li Hua and Tree
|
0 / 0 |
(None) |
|
|
6446 |
CF1797F
Li Hua and Path
|
0 / 0 |
(None) |
|
|
6179 |
CF1800G
Symmetree
|
0 / 0 |
(None) |
|
|
6124 |
CF1801E
Gasoline prices
|
0 / 0 |
(None) |
|
|
5946 |
CF1805D
A Wide, Wide Graph
|
0 / 0 |
(None) |
|
|
5935 |
CF1805E
There Should Be a Lot of Maximums
|
0 / 0 |
(None) |
|
|
5858 |
CF1806E
Tree Master
|
0 / 0 |
(None) |
|
|
5524 |
CF1810F
M-tree
|
0 / 0 |
(None) |
|
|
5213 |
CF1815B
Sum Graph
|
0 / 0 |
(None) |
|
|
5024 |
CF1819C
The Fox and the Complete Tree Traversal
|
0 / 0 |
(None) |
|
|
5002 |
CF1819E
Roads in E City
|
0 / 0 |
(None) |
|
|
4835 |
CF1822F
Gardening Friends
|
0 / 0 |
(None) |
|
|
4747 |
CF1823F
Random Walk
|
0 / 0 |
(None) |
|
|
4723 |
CF1824B1
LuoTianyi and the Floating Islands (Easy Version)
|
0 / 0 |
(None) |
|
|
4712 |
CF1824B2
LuoTianyi and the Floating Islands (Hard Version)
|
0 / 0 |
(None) |
|
|
4701 |
CF1824C
LuoTianyi and XOR-Tree
|
0 / 0 |
(None) |
|
|
4679 |
CF1824E
LuoTianyi and Cartridge
|
0 / 0 |
(None) |
|
|
4568 |
CF1827B1
Range Sorting (Easy Version)
|
0 / 0 |
(None) |
|
|
4535 |
CF1827D
Two Centroids
|
0 / 0 |
(None) |
|
|
4524 |
CF1827E
Bus Routes
|
0 / 0 |
(None) |
|
|
4390 |
CF1830A
Copil Copac Draws Trees
|
0 / 0 |
(None) |
|
|
4357 |
CF1830D
Mex Tree
|
0 / 0 |
(None) |
|
|
4157 |
CF1833G
Ksyusha and Chinchilla
|
0 / 0 |
(None) |
|
|
3946 |
CF1837E
Playoff Fixing
|
0 / 0 |
(None) |
|
|
3590 |
CF1842F
Tenzing and Tree
|
0 / 0 |
(None) |
|
|
3524 |
CF1843C
Sum in Binary Tree
|
0 / 0 |
(None) |
|
|
3512 |
CF1843D
Apple Tree
|
0 / 0 |
(None) |
|
|
3490 |
CF1843F1
Omsk Metro (simple version)
|
0 / 0 |
(None) |
|
|
3479 |
CF1843F2
Omsk Metro (hard version)
|
0 / 0 |
(None) |
|
|
3390 |
CF1844G
Tree Weights
|
0 / 0 |
(None) |
|
|
3024 |
CF1849F
XOR Partition
|
0 / 0 |
(None) |
|
|
2869 |
CF1851F
Lisa and the Martians
|
0 / 0 |
(None) |
|
|
2858 |
CF1851G
Vlad and the Mountains
|
0 / 0 |
(None) |
|
|
2713 |
CF1854D
Michael and Hotel
|
0 / 0 |
(None) |
|
|
2613 |
CF1856E1
PermuTree (easy version)
|
0 / 0 |
(None) |
|
|
2602 |
CF1856E2
PermuTree (hard version)
|
0 / 0 |
(None) |
|
|
2558 |
CF1857D
Strong Vertices
|
0 / 0 |
(None) |
|
|
2525 |
CF1857G
Counting Graphs
|
0 / 0 |
(None) |
|
|
2468 |
CF1858E1
Rollbacks (Easy Version)
|
0 / 0 |
(None) |
|
|
2457 |
CF1858E2
Rollbacks (Hard Version)
|
0 / 0 |
(None) |
|
|
2390 |
CF1859F
Teleportation in Byteland
|
0 / 0 |
(None) |
|
|
2290 |
CF1861C
Queries for the Array
|
0 / 0 |
(None) |
|
|
2091 |
CF1863H
Goldberg Machine 3
|
0 / 0 |
(None) |
|
|
2080 |
CF1863I
Redundant Routes
|
0 / 0 |
(None) |
|
|
2024 |
CF1864E
Guess Game
|
0 / 0 |
(None) |
|
|
1858 |
CF1866K
Keen Tree Calculation
|
0 / 0 |
(None) |
|
|
1713 |
CF1868C
Travel Plan
|
0 / 0 |
(None) |
|
|
1702 |
CF1868D
Flower-like Pseudotree
|
0 / 0 |
(None) |
|
|
1569 |
CF1870H
Standard Graph Problem
|
0 / 0 |
(None) |
|
|
10453 |
CF1873H
Mad City
|
0 / 0 |
(None) |
|
|
9634 |
CF1876E
Ball-Stackable
|
0 / 0 |
(None) |
|
|
9412 |
CF1876G
Clubstep
|
0 / 0 |
(None) |
|
|
8412 |
CF1878G
wxhtzdy ORO Tree
|
0 / 0 |
(None) |
|
|
7856 |
CF1879E
Interactive Game with Coloring
|
0 / 0 |
(None) |
|
|
7079 |
CF1881F
Minimum Maximum Distance
|
0 / 0 |
(None) |
|
|
6523 |
CF1882D
Tree XOR
|
0 / 0 |
(None) |
|
|
3857 |
CF1887D
Split
|
0 / 0 |
(None) |
|
|
3079 |
CF1889D
Game of Stacks
|
0 / 0 |
(None) |
|
|
2968 |
CF1889E
Doremy's Swapping Trees
|
0 / 0 |
(None) |
|
|
2857 |
CF1889F
Doremy's Average Tree
|
0 / 0 |
(None) |
|
|
1968 |
CF1891F
A Growing Tree
|
0 / 0 |
(None) |
|
|
10303 |
CF1899F
Alex's whims
|
0 / 0 |
(None) |
|
|
10299 |
CF1899G
Unusual Entertainment
|
0 / 0 |
(None) |