|
|
31621 |
codeforces#P1444E
Finding the Vertex
|
0 / 0 |
10 |
|
|
31629 |
codeforces#P1446E
Long Recovery
|
0 / 0 |
10 |
|
|
31640 |
codeforces#P1450G
Communism
|
0 / 0 |
10 |
|
|
31676 |
codeforces#P1456E
XOR-ranges
|
0 / 0 |
10 |
|
|
31682 |
codeforces#P1458F
Range Diameter Sum
|
0 / 0 |
10 |
|
|
31704 |
codeforces#P1464F
My Beautiful Madness
|
1 / 1 |
10 |
|
|
31744 |
codeforces#P1470F
Strange Covering
|
0 / 0 |
10 |
|
|
31786 |
codeforces#P1477F
Nezzar and Chocolate Bars
|
0 / 1 |
10 |
|
|
31795 |
codeforces#P1479E
School Clubs
|
0 / 0 |
10 |
|
|
31857 |
codeforces#P1491I
Ruler Of The Zoo
|
0 / 0 |
10 |
|
|
31908 |
codeforces#P1500F
Cupboards Jumps
|
2 / 3 |
10 |
|
|
31916 |
codeforces#P1503F
Balance the Cards
|
0 / 0 |
10 |
|
|
31940 |
codeforces#P1508F
Optimal Encoding
|
0 / 0 |
10 |
|
|
32010 |
codeforces#P1515H
Phoenix and Bits
|
0 / 0 |
10 |
|
|
32011 |
codeforces#P1515H
Phoenix and Bits
|
0 / 0 |
10 |
|
|
32012 |
codeforces#P1515H
Phoenix and Bits
|
0 / 0 |
10 |
|
|
32049 |
codeforces#P1517H
Fly Around the World
|
0 / 0 |
10 |
|
|
32085 |
codeforces#P1523H
Hopping Around the Array
|
0 / 0 |
10 |
|
|
32086 |
codeforces#P1523H
Hopping Around the Array
|
0 / 0 |
10 |
|
|
32154 |
codeforces#P1534H
Lost Nodes
|
0 / 0 |
10 |
|
|
32211 |
codeforces#P1545E1
AquaMoon and Time Stop (easy version)
|
0 / 0 |
10 |
|
|
32212 |
codeforces#P1545E2
AquaMoon and Time Stop (hard version)
|
1 / 1 |
10 |
|
|
32213 |
codeforces#P1545F
AquaMoon and Potatoes
|
1 / 1 |
10 |
|
|
32445 |
codeforces#P1588F
Jumping Through the Array
|
0 / 0 |
10 |
|
|
32538 |
codeforces#P1609H
Pushing Robots
|
0 / 0 |
10 |
|
|
32589 |
codeforces#P1616G
Just Add an Edge
|
1 / 1 |
10 |
|
|
32626 |
codeforces#P1621H
Trains and Airplanes
|
0 / 0 |
10 |
|
|
32627 |
codeforces#P1621I
Two Sequences
|
0 / 0 |
10 |
|
|
32784 |
codeforces#P1654H
Three Minimums
|
0 / 0 |
10 |
|
|
32871 |
codeforces#P1667F
Yin Yang
|
1 / 1 |
10 |
|
|
32978 |
codeforces#P1685D2
Permutation Weight (Hard Version)
|
0 / 0 |
(无) |
|
|
32979 |
codeforces#P1685E
The Ultimate LIS Problem
|
0 / 0 |
(无) |
|
|
32986 |
codeforces#P1687E
Become Big For Me
|
0 / 1 |
10 |
|
|
32987 |
codeforces#P1687F
Koishi's Unconscious Permutation
|
0 / 0 |
(无) |
|
|
33038 |
codeforces#P1696H
Maximum Product?
|
0 / 0 |
(无) |
|
|
33336 |
codeforces#P1746G
Olympiad Training
|
0 / 0 |
10 |
|
|
33479 |
codeforces#P1773L
Lisa's Sequences
|
0 / 0 |
10 |
|
|
33500 |
codeforces#P1776E
Crossing the Railways
|
0 / 0 |
(无) |
|
|
33509 |
codeforces#P1776N
Count Permutations
|
0 / 0 |
(无) |
|
|
33743 |
codeforces#P1815F
OH NO1 (-2-3-4)
|
0 / 0 |
10 |
|
|
33751 |
codeforces#P1817F
Entangled Substrings
|
0 / 0 |
10 |
|
|
33845 |
codeforces#P1835E
Old Mobile
|
0 / 0 |
10 |
|
|
33846 |
codeforces#P1835F
Good Graph
|
0 / 0 |
10 |
|
|
33888 |
codeforces#P1842I
Tenzing and Necklace
|
0 / 0 |
10 |
|
|
34171 |
codeforces#P1893E
Cacti Symphony
|
0 / 0 |
10 |
|
|
34269 |
codeforces#P1909H
Parallel Swaps Sort
|
0 / 0 |
10 |
|
|
34270 |
codeforces#P1909I
Short Permutation Problem
|
0 / 0 |
10 |
|
|
34321 |
codeforces#P1916G
Optimizations From Chelsu
|
0 / 0 |
10 |
|
|
34344 |
codeforces#P1919G
Tree LGM
|
0 / 0 |
10 |
|
|
34345 |
codeforces#P1919H
Tree Diameter
|
0 / 0 |
10 |
