|
|
2183 |
CF1601F
Two Sorts
|
0 / 0 |
(None) |
|
|
2167 |
CF1605D
Treelabeling
|
0 / 0 |
(None) |
|
|
2152 |
CF1607F
Robot on the Board 2
|
0 / 0 |
(None) |
|
|
2147 |
CF1608C
Game Master
|
0 / 0 |
(None) |
|
|
2142 |
CF1608G
Alphabetic Tree
|
0 / 0 |
(None) |
|
|
2127 |
CF1610F
Mashtali: a Space Oddysey
|
0 / 0 |
(None) |
|
|
2125 |
CF1610H
Squid Game
|
0 / 0 |
(None) |
|
|
2118 |
CF1611E1
Escape The Maze (easy version)
|
0 / 0 |
(None) |
|
|
2117 |
CF1611E2
Escape The Maze (hard version)
|
0 / 0 |
(None) |
|
|
2101 |
CF1613E
Crazy Robot
|
0 / 0 |
(None) |
|
|
2089 |
CF1615D
X(or)-mas Tree
|
0 / 0 |
(None) |
|
|
2088 |
CF1615E
Purple Crayon
|
0 / 0 |
(None) |
|
|
2076 |
CF1616G
Just Add an Edge
|
0 / 0 |
(None) |
|
|
2069 |
CF1617E
Christmas Chocolates
|
0 / 0 |
(None) |
|
|
2062 |
CF1618F
Reverse
|
0 / 0 |
(None) |
|
|
2053 |
CF1619G
Unusual Minesweeper
|
0 / 0 |
(None) |
|
|
2041 |
CF1621C
Hidden Permutations
|
0 / 0 |
(None) |
|
|
2036 |
CF1621H
Trains and Airplanes
|
0 / 0 |
(None) |
|
|
2026 |
CF1623B
Game on Ranges
|
0 / 0 |
(None) |
|
|
2022 |
CF1623E
Middle Duplication
|
0 / 0 |
(None) |
|
|
2015 |
CF1624G
MinOr Tree
|
0 / 0 |
(None) |
|
|
2009 |
CF1625E1
Cats on the Upgrade (easy version)
|
0 / 0 |
(None) |
|
|
2008 |
CF1625E2
Cats on the Upgrade (hard version)
|
0 / 0 |
(None) |
|
|
2003 |
CF1626E
Black and White Tree
|
0 / 0 |
(None) |
|
|
1998 |
CF1627C
Not Assigning
|
0 / 0 |
(None) |
|
|
1971 |
CF1632E1
Distance Tree (easy version)
|
0 / 0 |
(None) |
|
|
1970 |
CF1632E2
Distance Tree (hard version)
|
0 / 0 |
(None) |
|
|
1963 |
CF1633E
Spanning Tree Queries
|
0 / 0 |
(None) |
|
|
1956 |
CF1634E
Fair Share
|
0 / 0 |
(None) |
|
|
1950 |
CF1635E
Cars
|
0 / 0 |
(None) |
|
|
1942 |
CF1637F
Towers
|
0 / 0 |
(None) |
|
|
1901 |
CF1646D
Weight the Tree
|
0 / 0 |
(None) |
|
|
1894 |
CF1647E
Madoka and the Sixth-graders
|
0 / 0 |
(None) |
|
|
1887 |
CF1648E
Air Reform
|
0 / 0 |
(None) |
|
|
1886 |
CF1648F
Two Avenues
|
0 / 0 |
(None) |
|
|
1876 |
CF1650G
Counting Shortcuts
|
0 / 0 |
(None) |
|
|
1872 |
CF1651D
Nearest Excluded Points
|
0 / 0 |
(None) |
|
|
1871 |
CF1651E
Sum of Matchings
|
0 / 0 |
(None) |
|
|
1865 |
CF1654D
Potion Brewing Class
|
0 / 0 |
(None) |
|
|
1862 |
CF1654G
Snowy Mountain
|
0 / 0 |
(None) |
|
|
1854 |
CF1656E
Equal Tree Sums
|
0 / 0 |
(None) |
|
|
1843 |
CF1657F
Words on Tree
|
0 / 0 |
(None) |
|
|
1830 |
CF1659E
AND-MEX Walk
|
0 / 0 |
(None) |
|
|
1829 |
CF1659F
Tree and Permutation Game
|
0 / 0 |
(None) |
|
|
1819 |
CF1661B
Getting Zero
|
0 / 0 |
(None) |
|
|
1808 |
CF1662F
Antennas
|
0 / 0 |
(None) |
|
|
1798 |
CF1662O
Circular Maze
|
0 / 0 |
(None) |
|
|
1771 |
CF1666L
Labyrinth
|
0 / 0 |
(None) |
|
|
1766 |
CF1667D
Edge Elimination
|
0 / 0 |
(None) |
|
|
1754 |
CF1669G
Fall Down
|
0 / 0 |
(None) |
|
|
1750 |
CF1670C
Where is the Pizza?
|
0 / 0 |
(None) |
|
|
1748 |
CF1670E
Hemose on the Tree
|
0 / 0 |
(None) |
|
|
1731 |
CF1672F2
Checker for Array Shuffling
|
0 / 0 |
(None) |
|
|
1714 |
CF1674G
Remove Directed Edges
|
0 / 0 |
(None) |
|
|
1707 |
CF1675F
Vlad and Unfinished Business
|
0 / 0 |
(None) |
|
|
1698 |
CF1676G
White-Black Balanced Subtrees
|
0 / 0 |
(None) |
|
|
1693 |
CF1677C
Tokitsukaze and Two Colorful Tapes
|
0 / 0 |
(None) |
|
|
1682 |
CF1679D
Toss a Coin to Your Graph...
|
0 / 0 |
(None) |
|
|
1673 |
CF1680F
Lenient Vertex Cover
|
0 / 0 |
(None) |
|
|
1668 |
CF1681D
Required Length
|
0 / 0 |
(None) |
|
|
1666 |
CF1681F
Unique Occurrences
|
0 / 0 |
(None) |
|
|
1661 |
CF1682E
Unordered Swaps
|
0 / 0 |
(None) |
|
|
1651 |
CF1684H
Hard Cut
|
0 / 0 |
(None) |
|
|
1646 |
CF1685D1
Permutation Weight (Easy Version)
|
0 / 0 |
(None) |
|
|
1628 |
CF1689C
Infected Tree
|
0 / 0 |
(None) |
|
|
1626 |
CF1689E
ANDfinity
|
0 / 0 |
(None) |
|
|
1612 |
CF1691E
Number of Groups
|
0 / 0 |
(None) |
|
|
1611 |
CF1691F
K-Set Tree
|
0 / 0 |
(None) |
|
|
1600 |
CF1693B
Fake Plastic Trees
|
0 / 0 |
(None) |
|
|
1589 |
CF1695D1
Tree Queries (Easy Version)
|
0 / 0 |
(None) |
|
|
1588 |
CF1695D2
Tree Queries (Hard Version)
|
0 / 0 |
(None) |
|
|
1587 |
CF1695E
Ambiguous Dominoes
|
0 / 0 |
(None) |
|
|
1581 |
CF1696F
Tree Recovery
|
0 / 0 |
(None) |
|
|
1540 |
CF1702E
Split Into Two Sets
|
0 / 0 |
(None) |
|
|
1538 |
CF1702G1
Passable Paths (easy version)
|
0 / 0 |
(None) |
|
|
1537 |
CF1702G2
Passable Paths (hard version)
|
0 / 0 |
(None) |
|
|
1505 |
CF1706E
Qpwoeirut and Vertices
|
0 / 0 |
(None) |
|
|
1501 |
CF1707C
DFS Trees
|
0 / 0 |
(None) |
|
|
1500 |
CF1707D
Partial Virtual Trees
|
0 / 0 |
(None) |
|
|
1490 |
CF1709E
XOR Tree
|
0 / 0 |
(None) |
|
|
1474 |
CF1712F
Triameter
|
0 / 0 |
(None) |
|
|
1460 |
CF1714G
Path Prefixes
|
0 / 0 |
(None) |
|
|
1448 |
CF1716E
Swap and Maximum Block
|
0 / 0 |
(None) |
|
|
1418 |
CF1721D
Maximum AND
|
0 / 0 |
(None) |
|
|
1417 |
CF1721E
Prefix Function Queries
|
0 / 0 |
(None) |
|
|
1416 |
CF1721F
Matching Reduction
|
0 / 0 |
(None) |
|
|
10459 |
CF1722F
L-shapes
|
0 / 0 |
(None) |
|
|
10439 |
CF1726D
Edge Split
|
0 / 0 |
(None) |
|
|
10382 |
CF1735C
Phase Shift
|
0 / 0 |
(None) |
|
|
10357 |
CF1738D
Permutation Addicts
|
0 / 0 |
(None) |
|
|
10267 |
CF1739D
Reset K Edges
|
0 / 0 |
(None) |
|
|
10190 |
CF1740E
Hanging Hearts
|
0 / 0 |
(None) |
|
|
10101 |
CF1741D
Masha and a Beautiful Tree
|
0 / 0 |
(None) |
|
|
10067 |
CF1741G
Kirill and Company
|
0 / 0 |
(None) |
|
|
9790 |
CF1746D
Paths on the Tree
|
0 / 0 |
(None) |
|
|
9568 |
CF1749E
Cactus Wall
|
0 / 0 |
(None) |
|
|
9557 |
CF1749F
Distance to the Path
|
0 / 0 |
(None) |
|
|
9413 |
CF1753D
The Beach
|
0 / 0 |
(None) |
|
|
9313 |
CF1758E
Tick, Tock
|
0 / 0 |
(None) |
|
|
9145 |
CF1760G
SlavicG's Favorite Problem
|
0 / 0 |
(None) |
