|
|
34138 |
codeforces#P1884C
Medium Design
|
1 / 1 |
10 |
|
|
34139 |
codeforces#P1884D
Counting Rhyme
|
0 / 0 |
(无) |
|
|
34145 |
codeforces#P1886E
I Wanna be the Team Leader
|
0 / 0 |
(无) |
|
|
34154 |
codeforces#P1889C1
Doremy's Drying Plan (Easy Version)
|
1 / 1 |
10 |
|
|
34155 |
codeforces#P1889C2
Doremy's Drying Plan (Hard Version)
|
0 / 0 |
(无) |
|
|
34158 |
codeforces#P1889F
Doremy's Average Tree
|
0 / 0 |
(无) |
|
|
34171 |
codeforces#P1893E
Cacti Symphony
|
0 / 0 |
10 |
|
|
34176 |
codeforces#P1895C
Torn Lucky Ticket
|
2 / 2 |
10 |
|
|
34179 |
codeforces#P1895F
Fancy Arrays
|
0 / 0 |
(无) |
|
|
34180 |
codeforces#P1895G
Two Characters, Two Colors
|
0 / 0 |
(无) |
|
|
34188 |
codeforces#P1896H1
Cyclic Hamming (Easy Version)
|
0 / 0 |
(无) |
|
|
34189 |
codeforces#P1896H2
Cyclic Hamming (Hard Version)
|
0 / 0 |
(无) |
|
|
34204 |
codeforces#P1900B
Laura and Operations
|
0 / 0 |
(无) |
|
|
34205 |
codeforces#P1900C
Anji's Binary Tree
|
0 / 0 |
(无) |
|
|
34206 |
codeforces#P1900D
Small GCD
|
1 / 1 |
10 |
|
|
34207 |
codeforces#P1900E
Transitive Graph
|
1 / 2 |
10 |
|
|
34212 |
codeforces#P1901D
Yet Another Monster Fight
|
0 / 0 |
(无) |
|
|
34213 |
codeforces#P1901E
Compressed Tree
|
1 / 1 |
10 |
|
|
34218 |
codeforces#P1902D
Robot Queries
|
1 / 3 |
6 |
|
|
34223 |
codeforces#P1903C
Theofanis' Nightmare
|
0 / 0 |
(无) |
|
|
34225 |
codeforces#P1903D2
Maximum And Queries (hard version)
|
0 / 0 |
(无) |
|
|
34226 |
codeforces#P1903E
Geo Game
|
1 / 15 |
10 |
|
|
34229 |
codeforces#P1904B
Collecting Game
|
0 / 0 |
(无) |
|
|
34239 |
codeforces#P1905E
One-X
|
0 / 0 |
(无) |
|
|
34245 |
codeforces#P1906E
Merge Not Sort
|
1 / 2 |
6 |
|
|
34248 |
codeforces#P1906H
Twin Friends
|
0 / 0 |
8 |
|
|
34250 |
codeforces#P1906J
Count BFS Graph
|
0 / 0 |
7 |
|
|
34266 |
codeforces#P1909F1
Small Permutation Problem (Easy Version)
|
0 / 0 |
8 |
|
|
34267 |
codeforces#P1909F2
Small Permutation Problem (Hard Version)
|
0 / 0 |
9 |
|
|
34270 |
codeforces#P1909I
Short Permutation Problem
|
0 / 0 |
10 |
|
|
34275 |
codeforces#P1910E
Maximum Sum Subarrays
|
0 / 0 |
7 |
|
|
34279 |
codeforces#P1910I
Inverse Problem
|
0 / 0 |
10 |
|
|
34291 |
codeforces#P1912K
Kim's Quest
|
0 / 0 |
6 |
|
|
34296 |
codeforces#P1913D
Array Collapse
|
0 / 0 |
7 |
|
|
34302 |
codeforces#P1914D
Three Activities
|
0 / 0 |
4 |
|
|
34305 |
codeforces#P1914F
Programming Competition
|
0 / 0 |
6 |
|
|
34306 |
codeforces#P1914G1
Light Bulbs (Easy Version)
|
0 / 0 |
7 |
|
|
34307 |
codeforces#P1914G2
Light Bulbs (Hard Version)
|
0 / 0 |
8 |
|
|
34321 |
codeforces#P1916G
Optimizations From Chelsu
|
0 / 0 |
10 |
|
|
34322 |
codeforces#P1916H1
Matrix Rank (Easy Version)
|
1 / 1 |
10 |
|
|
34323 |
codeforces#P1916H2
Matrix Rank (Hard Version)
|
1 / 1 |
10 |
|
|
34325 |
codeforces#P1917B
Erase First or Second Letter
|
1 / 1 |
3 |
|
|
34327 |
codeforces#P1917D
Yet Another Inversions Problem
|
1 / 2 |
8 |
|
|
34329 |
codeforces#P1917F
Construct Tree
|
1 / 6 |
9 |
|
|
34332 |
codeforces#P1918C
XOR-distance
|
1 / 1 |
10 |
|
|
34333 |
codeforces#P1918D
Blocking Elements
|
1 / 1 |
10 |
|
|
34339 |
codeforces#P1919C
Grouping Increases
|
2 / 2 |
4 |
|
|
34341 |
codeforces#P1919E
Counting Prefixes
|
1 / 7 |
10 |
|
|
34350 |
codeforces#P1920E
Counting Binary Strings
|
1 / 1 |
7 |
|
|
34359 |
codeforces#P1921G
Mischievous Shooter
|
0 / 1 |
10 |
