|
3224 |
codeforces#P900B Position in Fraction
|
0 / 0 |
4 |
|
3223 |
codeforces#P900C Remove Extra One
|
0 / 0 |
5 |
|
3222 |
codeforces#P900D Unusual Sequences
|
0 / 0 |
7 |
|
3221 |
codeforces#P900E Maximum Questions
|
0 / 0 |
7 |
|
3220 |
codeforces#P901A Hashing Trees
|
0 / 0 |
5 |
|
3219 |
codeforces#P901B GCD of Polynomials
|
0 / 0 |
8 |
|
3218 |
codeforces#P901C Bipartite Segments
|
0 / 0 |
8 |
|
3217 |
codeforces#P901D Weighting a Tree
|
0 / 0 |
10 |
|
3216 |
codeforces#P901E Cyclic Cipher
|
0 / 0 |
10 |
|
3215 |
codeforces#P902A Visiting a Friend
|
0 / 0 |
3 |
|
3214 |
codeforces#P902B Coloring a Tree
|
0 / 0 |
4 |
|
3213 |
codeforces#P903A Hungry Student Problem
|
1 / 1 |
3 |
|
3212 |
codeforces#P903B The Modcrab
|
0 / 0 |
4 |
|
3211 |
codeforces#P903C Boxes Packing
|
0 / 0 |
4 |
|
3210 |
codeforces#P903D Almost Difference
|
0 / 0 |
8 |
|
3209 |
codeforces#P903E Swapping Characters
|
0 / 0 |
8 |
|
3208 |
codeforces#P903F Clear The Matrix
|
1 / 1 |
8 |
|
3207 |
codeforces#P903G Yet Another Maxflow Problem
|
0 / 0 |
10 |
|
3206 |
codeforces#P906A Shockers
|
0 / 0 |
5 |
|
3205 |
codeforces#P906B Seating of Students
|
0 / 0 |
8 |
|
3204 |
codeforces#P906C Party
|
0 / 0 |
9 |
|
3203 |
codeforces#P906D Power Tower
|
0 / 0 |
10 |
|
3202 |
codeforces#P906E Reverses
|
0 / 0 |
10 |
|
3201 |
codeforces#P907A Masha and Bears
|
0 / 0 |
4 |
|
3200 |
codeforces#P907B Tic-Tac-Toe
|
0 / 0 |
4 |
|
3199 |
codeforces#P908A New Year and Counting Cards
|
0 / 0 |
3 |
|
3198 |
codeforces#P908B New Year and Buggy Bot
|
0 / 0 |
4 |
|
3197 |
codeforces#P908C New Year and Curling
|
0 / 0 |
5 |
|
3196 |
codeforces#P908D New Year and Arbitrary Arrangement
|
1 / 3 |
8 |
|
3195 |
codeforces#P908E New Year and Entity Enumeration
|
0 / 0 |
9 |
|
3194 |
codeforces#P908F New Year and Rainbow Roads
|
0 / 0 |
9 |
|
3193 |
codeforces#P908G New Year and Original Order
|
0 / 0 |
10 |
|
3192 |
codeforces#P908H New Year and Boolean Bridges
|
0 / 0 |
10 |
|
3191 |
codeforces#P909A Generate Login
|
1 / 1 |
3 |
|
3190 |
codeforces#P909B Segments
|
1 / 1 |
4 |
|
3189 |
codeforces#P909C Python Indentation
|
0 / 0 |
6 |
|
3188 |
codeforces#P909D Colorful Points
|
0 / 0 |
7 |
|
3187 |
codeforces#P909E Coprocessor
|
0 / 0 |
6 |
|
3186 |
codeforces#P909F AND-permutations
|
0 / 0 |
9 |
|
3185 |
codeforces#P910A The Way to Home
|
0 / 0 |
3 |
|
3184 |
codeforces#P910B Door Frames
|
0 / 0 |
5 |
|
3183 |
codeforces#P910C Minimum Sum
|
0 / 0 |
5 |
|
3182 |
codeforces#P911A Nearest Minimums
|
0 / 0 |
3 |
|
3181 |
codeforces#P911B Two Cakes
|
0 / 0 |
4 |
|
3180 |
codeforces#P911C Three Garlands
|
0 / 0 |
4 |
|
3179 |
codeforces#P911D Inversion Counting
|
0 / 0 |
6 |
|
3178 |
codeforces#P911E Stack Sorting
|
0 / 0 |
7 |
|
3177 |
codeforces#P911F Tree Destruction
|
0 / 0 |
9 |
|
3176 |
codeforces#P911G Mass Change Queries
|
1 / 4 |
9 |
|
3175 |
codeforces#P912A Tricky Alchemy
|
0 / 0 |
3 |