|
229 |
codeforces#P1506E Restoring the Permutation
|
0 / 0 |
5 |
|
228 |
codeforces#P1506F Triangular Paths
|
0 / 0 |
7 |
|
227 |
codeforces#P1506G Maximize the Remaining String
|
0 / 0 |
7 |
|
226 |
codeforces#P1508A Binary Literature
|
0 / 0 |
6 |
|
225 |
codeforces#P1508B Almost Sorted
|
0 / 0 |
6 |
|
224 |
codeforces#P1508C Complete the MST
|
0 / 0 |
9 |
|
223 |
codeforces#P1508D Swap Pass
|
0 / 0 |
10 |
|
222 |
codeforces#P1508E Tree Calendar
|
0 / 0 |
10 |
|
221 |
codeforces#P1508F Optimal Encoding
|
0 / 0 |
10 |
|
220 |
codeforces#P1509A Average Height
|
1 / 1 |
3 |
|
219 |
codeforces#P1509B TMT Document
|
0 / 0 |
3 |
|
218 |
codeforces#P1509C The Sports Festival
|
0 / 0 |
6 |
|
3831 |
codeforces#P1510A __NO_TITLE__
|
0 / 0 |
(无) |
|
217 |
codeforces#P1510B Button Lock
|
0 / 0 |
10 |
|
216 |
codeforces#P1510C Cactus Not Enough
|
0 / 0 |
10 |
|
215 |
codeforces#P1510D Digits
|
0 / 0 |
7 |
|
3830 |
codeforces#P1510E __NO_TITLE__
|
0 / 0 |
(无) |
|
214 |
codeforces#P1510F Fiber Shape
|
0 / 0 |
10 |
|
3829 |
codeforces#P1510G __NO_TITLE__
|
0 / 0 |
(无) |
|
213 |
codeforces#P1510H Hard Optimization
|
0 / 0 |
10 |
|
212 |
codeforces#P1510I Is It Rated?
|
0 / 0 |
10 |
|
211 |
codeforces#P1510J Japanese Game
|
0 / 0 |
10 |
|
210 |
codeforces#P1510K King's Task
|
0 / 0 |
4 |
|
209 |
codeforces#P1511A Review Site
|
1 / 1 |
3 |
|
208 |
codeforces#P1511B GCD Length
|
0 / 0 |
3 |
|
207 |
codeforces#P1511C Yet Another Card Deck
|
0 / 0 |
3 |
|
206 |
codeforces#P1511D Min Cost String
|
0 / 0 |
5 |
|
205 |
codeforces#P1511E Colorings and Dominoes
|
0 / 0 |
7 |
|
204 |
codeforces#P1511F Chainword
|
0 / 0 |
10 |
|
203 |
codeforces#P1511G Chips on a Board
|
0 / 0 |
10 |
|
202 |
codeforces#P1512A Spy Detected!
|
2 / 2 |
3 |
|
200 |
codeforces#P1512B Almost Rectangle
|
1 / 1 |
3 |
|
201 |
codeforces#P1512C A-B Palindrome
|
1 / 1 |
4 |
|
199 |
codeforces#P1512D Corrupted Array
|
1 / 1 |
4 |
|
198 |
codeforces#P1512E Permutation by Sum
|
1 / 1 |
5 |
|
197 |
codeforces#P1512F Education
|
1 / 1 |
6 |
|
195 |
codeforces#P1512G Short Task
|
0 / 0 |
5 |
|
196 |
codeforces#P1512G Short Task
|
1 / 1 |
5 |
|
194 |
codeforces#P1513A Array and Peaks
|
0 / 0 |
3 |
|
192 |
codeforces#P1513B AND Sequences
|
0 / 0 |
4 |
|
193 |
codeforces#P1513B AND Sequences
|
0 / 0 |
4 |
|
189 |
codeforces#P1513C Add One
|
1 / 4 |
5 |
|
190 |
codeforces#P1513C Add One
|
0 / 0 |
5 |
|
191 |
codeforces#P1513C Add One
|
0 / 0 |
5 |
|
186 |
codeforces#P1513D GCD and MST
|
0 / 0 |
7 |
|
187 |
codeforces#P1513D GCD and MST
|
0 / 0 |
7 |
|
188 |
codeforces#P1513D GCD and MST
|
0 / 0 |
7 |
|
185 |
codeforces#P1513E Cost Equilibrium
|
0 / 0 |
8 |
|
183 |
codeforces#P1513F Swapping Problem
|
0 / 0 |
9 |
|
184 |
codeforces#P1513F Swapping Problem
|
0 / 0 |
9 |