|
|
540 |
codeforces#P1444E Finding the Vertex
|
0 / 0 |
10 |
|
|
531 |
codeforces#P1446E Long Recovery
|
0 / 0 |
10 |
|
|
521 |
codeforces#P1450G Communism
|
0 / 0 |
10 |
|
|
485 |
codeforces#P1456E XOR-ranges
|
0 / 0 |
10 |
|
|
479 |
codeforces#P1458F Range Diameter Sum
|
0 / 0 |
10 |
|
|
457 |
codeforces#P1464F My Beautiful Madness
|
1 / 1 |
10 |
|
|
417 |
codeforces#P1470F Strange Covering
|
0 / 0 |
10 |
|
|
376 |
codeforces#P1477F Nezzar and Chocolate Bars
|
0 / 1 |
10 |
|
|
368 |
codeforces#P1479E School Clubs
|
0 / 0 |
10 |
|
|
304 |
codeforces#P1491I Ruler Of The Zoo
|
0 / 0 |
10 |
|
|
253 |
codeforces#P1500F Cupboards Jumps
|
1 / 2 |
10 |
|
|
245 |
codeforces#P1503F Balance the Cards
|
0 / 0 |
10 |
|
|
221 |
codeforces#P1508F Optimal Encoding
|
0 / 0 |
10 |
|
|
152 |
codeforces#P1515H Phoenix and Bits
|
0 / 0 |
10 |
|
|
153 |
codeforces#P1515H Phoenix and Bits
|
0 / 0 |
10 |
|
|
154 |
codeforces#P1515H Phoenix and Bits
|
0 / 0 |
10 |
|
|
115 |
codeforces#P1517H Fly Around the World
|
0 / 0 |
10 |
|
|
78 |
codeforces#P1523H Hopping Around the Array
|
0 / 0 |
10 |
|
|
79 |
codeforces#P1523H Hopping Around the Array
|
0 / 0 |
10 |
|
|
34 |
codeforces#P1534H Lost Nodes
|
0 / 0 |
10 |
|
|
7269 |
codeforces#P1545E1 AquaMoon and Time Stop (easy version)
|
0 / 0 |
10 |
|
|
7157 |
codeforces#P1545E2 AquaMoon and Time Stop (hard version)
|
1 / 1 |
10 |
|
|
7155 |
codeforces#P1545F AquaMoon and Potatoes
|
1 / 1 |
10 |
|
|
7470 |
codeforces#P1588F Jumping Through the Array
|
0 / 0 |
10 |
|
|
7508 |
codeforces#P1609H Pushing Robots
|
0 / 0 |
10 |
|
|
7577 |
codeforces#P1616G Just Add an Edge
|
1 / 1 |
10 |
|
|
7585 |
codeforces#P1621H Trains and Airplanes
|
0 / 0 |
10 |
|
|
7584 |
codeforces#P1621I Two Sequences
|
0 / 0 |
10 |
|
|
7731 |
codeforces#P1654H Three Minimums
|
0 / 0 |
10 |
|
|
7831 |
codeforces#P1667F Yin Yang
|
1 / 1 |
10 |
|
|
7931 |
codeforces#P1685D2 Permutation Weight (Hard Version)
|
0 / 0 |
(无) |
|
|
7930 |
codeforces#P1685E The Ultimate LIS Problem
|
0 / 0 |
(无) |
|
|
7946 |
codeforces#P1687E Become Big For Me
|
0 / 1 |
10 |
|
|
7945 |
codeforces#P1687F Koishi's Unconscious Permutation
|
0 / 0 |
(无) |
|
|
7997 |
codeforces#P1696H Maximum Product?
|
0 / 0 |
(无) |
|
|
8247 |
codeforces#P1746G Olympiad Training
|
0 / 0 |
10 |
|
|
8368 |
codeforces#P1773L Lisa's Sequences
|
0 / 0 |
10 |
|
|
8924 |
codeforces#P1776E Crossing the Railways
|
0 / 0 |
(无) |
|
|
8915 |
codeforces#P1776N Count Permutations
|
0 / 0 |
(无) |
|
|
8695 |
codeforces#P1815F OH NO1 (-2-3-4)
|
0 / 0 |
10 |
|
|
8731 |
codeforces#P1817F Entangled Substrings
|
0 / 0 |
10 |
|
|
8837 |
codeforces#P1835E Old Mobile
|
0 / 0 |
10 |
|
|
8836 |
codeforces#P1835F Good Graph
|
0 / 0 |
10 |
|
|
8842 |
codeforces#P1842I Tenzing and Necklace
|
0 / 0 |
10 |
|
|
9145 |
codeforces#P1893E Cacti Symphony
|
0 / 0 |
10 |
|
|
9290 |
codeforces#P1909H Parallel Swaps Sort
|
0 / 0 |
10 |
|
|
9289 |
codeforces#P1909I Short Permutation Problem
|
0 / 0 |
10 |
|
|
9260 |
codeforces#P1916G Optimizations From Chelsu
|
0 / 0 |
10 |
|
|
9300 |
codeforces#P1919G Tree LGM
|
0 / 0 |
10 |
|
|
9299 |
codeforces#P1919H Tree Diameter
|
0 / 0 |
10 |
