|
|
748 |
P1835D
Doctor's Brown Hypothesis
|
0 / 0 |
10 |
|
|
746 |
P1835F
Good Graph
|
0 / 0 |
10 |
|
|
727 |
P1839E
Decreasing Game
|
0 / 0 |
9 |
|
|
721 |
P1840F
Railguns
|
0 / 0 |
8 |
|
|
707 |
P1842F
Tenzing and Tree
|
0 / 0 |
9 |
|
|
700 |
P1843D
Apple Tree
|
0 / 0 |
4 |
|
|
698 |
P1843F1
Omsk Metro (simple version)
|
0 / 0 |
6 |
|
|
697 |
P1843F2
Omsk Metro (hard version)
|
0 / 0 |
8 |
|
|
692 |
P1844E
Great Grids
|
0 / 0 |
9 |
|
|
689 |
P1844G
Tree Weights
|
0 / 0 |
10 |
|
|
668 |
P1847F
The Boss's Identity
|
0 / 0 |
9 |
|
|
648 |
P1850H
The Third Letter
|
0 / 0 |
5 |
|
|
643 |
P1851E
Nastya and Potions
|
0 / 0 |
5 |
|
|
619 |
P1856E1
PermuTree (easy version)
|
0 / 0 |
6 |
|
|
618 |
P1856E2
PermuTree (hard version)
|
0 / 0 |
10 |
|
|
606 |
P1858E1
Rollbacks (Easy Version)
|
0 / 0 |
9 |
|
|
599 |
P1859F
Teleportation in Byteland
|
0 / 0 |
10 |
|
|
594 |
P1860E
Fast Travel Text Editor
|
0 / 0 |
9 |
|
|
590 |
P1861C
Queries for the Array
|
0 / 0 |
5 |
|
|
575 |
P1863E
Speedrun
|
0 / 0 |
7 |
|
|
559 |
P1866C
Completely Searching for Inversions
|
0 / 0 |
6 |
|
|
545 |
P1867D
Cyclic Operations
|
0 / 0 |
6 |
|
|
542 |
P1867F
Most Different Tree
|
0 / 0 |
10 |
|
|
519 |
P1872F
Selling a Menagerie
|
0 / 0 |
6 |
|
|
510 |
P1873H
Mad City
|
0 / 0 |
5 |
|
|
508 |
P1874B
Jellyfish and Math
|
0 / 0 |
9 |
|
|
497 |
P1876C
Autosynthesis
|
0 / 0 |
7 |
|
|
496 |
P1876D
Lexichromatography
|
0 / 0 |
9 |
|
|
484 |
P1878G
wxhtzdy ORO Tree
|
0 / 0 |
8 |
|
|
479 |
P1879E
Interactive Game with Coloring
|
0 / 0 |
9 |
|
|
472 |
P1881F
Minimum Maximum Distance
|
0 / 0 |
5 |
|
|
467 |
P1882D
Tree XOR
|
0 / 0 |
6 |
|
|
435 |
P1889D
Game of Stacks
|
0 / 0 |
10 |
|
|
434 |
P1889E
Doremy's Swapping Trees
|
0 / 0 |
10 |
|
|
425 |
P1891F
A Growing Tree
|
0 / 0 |
7 |
|
|
424 |
P1893A
Anonymous Informant
|
0 / 0 |
4 |
|
|
420 |
P1893E
Cacti Symphony
|
0 / 0 |
10 |
|
|
413 |
P1895E
Infinite Card Game
|
0 / 0 |
8 |
|
|
396 |
P1898F
Vova Escapes the Matrix
|
0 / 0 |
10 |
|
|
389 |
P1899G
Unusual Entertainment
|
0 / 0 |
6 |
|
|
386 |
P1900C
Anji's Binary Tree
|
0 / 0 |
4 |
|
|
384 |
P1900E
Transitive Graph
|
0 / 0 |
7 |
|
|
378 |
P1901E
Compressed Tree
|
0 / 0 |
8 |
|
|
371 |
P1902F
Trees and XOR Queries Again
|
0 / 0 |
9 |
|
|
358 |
P1904E
Tree Queries
|
0 / 0 |
9 |
|
|
357 |
P1904F
Beautiful Tree
|
0 / 0 |
10 |
|
|
352 |
P1905E
One-X
|
0 / 0 |
9 |
|
|
331 |
P1907G
Lights
|
0 / 0 |
8 |
|
|
286 |
P1914F
Programming Competition
|
0 / 0 |
6 |
|
|
285 |
P1914G1
Light Bulbs (Easy Version)
|
0 / 0 |
7 |
|
|
284 |
P1914G2
Light Bulbs (Hard Version)
|
0 / 0 |
8 |
|
|
272 |
P1916E
Happy Life in University
|
0 / 0 |
8 |
|
|
271 |
P1916F
Group Division
|
0 / 0 |
10 |
|
|
256 |
P1918F
Caterpillar on a Tree
|
0 / 0 |
9 |
|
|
240 |
P1920F1
Smooth Sailing (Easy Version)
|
0 / 0 |
9 |
|
|
221 |
P1923E
Count Paths
|
0 / 0 |
7 |
|
|
205 |
P1926F
Vlad and Avoiding X
|
0 / 0 |
8 |
|
|
204 |
P1926G
Vlad and Trouble at MIT
|
0 / 0 |
6 |
|
|
198 |
P1927F
Microcycle
|
0 / 0 |
6 |
|
|
186 |
P1929E
Sasha and the Happy Tree Cutting
|
0 / 0 |
8 |
|
|
185 |
P1929F
Sasha and the Wedding Binary Search Tree
|
0 / 0 |
8 |
|
|
178 |
P1930F
Maximize the Difference
|
0 / 0 |
10 |
|
|
176 |
P1930H
Interactive Mex Tree
|
0 / 0 |
10 |
|
|
169 |
P1931F
Chat Screenshots
|
0 / 0 |
5 |
|
|
155 |
P1933F
Turtle Mission: Robot and the Earthquake
|
0 / 0 |
7 |
|
|
154 |
P1933G
Turtle Magic: Royal Turtle Shell Pattern
|
0 / 0 |
8 |
|
|
142 |
P1935F
Andrey's Tree
|
0 / 0 |
10 |
|
|
109 |
P1941D
Rudolf and the Ball Game
|
0 / 0 |
4 |
|
|
106 |
P1941G
Rudolf and Subway
|
0 / 0 |
7 |
|
|
101 |
P1942D
Learning to Paint
|
0 / 0 |
7 |
|
|
94 |
P1943C
Tree Compass
|
0 / 0 |
8 |
|
|
73 |
P1946F
Nobody is needed
|
0 / 0 |
9 |
|
|
70 |
P1948C
Arrow Path
|
0 / 2 |
4 |
|
|
65 |
P1949A
Grove
|
0 / 0 |
(无) |
|
|
63 |
P1949C
Annual Ants' Gathering
|
0 / 0 |
(无) |
|
|
57 |
P1949I
Disks
|
0 / 0 |
(无) |
|
|
48 |
P1950G
Shuffling Songs
|
0 / 0 |
6 |
|
|
32 |
P1952G
Mathematician Takeover
|
0 / 0 |
(无) |
|
|
16 |
P1955G
GCD on a grid
|
0 / 0 |
6 |
|
|
1 |
P1957F2
Frequency Mismatch (Hard Version)
|
1 / 1 |
10 |
|
|
9514 |
P1971F
Circle Perimeter
|
0 / 0 |
5 |
|
|
9512 |
P1971H
±1
|
0 / 0 |
7 |
|
|
9493 |
P1975D
Paint the Tree
|
0 / 0 |
5 |
|
|
9492 |
P1975E
Chain Queries
|
0 / 0 |
7 |
|
|
9491 |
P1975F
Set
|
0 / 0 |
10 |
|
|
9483 |
P1976E
Splittable Permutations
|
0 / 0 |
9 |
|
|
9482 |
P1976F
Remove Bridges
|
0 / 0 |
10 |
|
|
9471 |
P1978F
Large Graph
|
0 / 0 |
9 |
|
|
9457 |
P1980G
Yasya and the Mysterious Tree
|
0 / 0 |
8 |
|
|
9453 |
P1981D
Turtle and Multiplication
|
0 / 0 |
9 |
|
|
9428 |
P1985H1
Maximize the Largest Component (Easy Version)
|
0 / 0 |
5 |
|
|
9427 |
P1985H2
Maximize the Largest Component (Hard Version)
|
0 / 0 |
8 |
|
|
9421 |
P1986F
Non-academic Problem
|
0 / 0 |
(无) |
