|
|
30124 |
codeforces#P1154D
Walking Robot
|
0 / 0 |
5 |
|
|
30125 |
codeforces#P1154E
Two Teams
|
0 / 0 |
6 |
|
|
30126 |
codeforces#P1154F
Shovels Shop
|
0 / 0 |
7 |
|
|
30127 |
codeforces#P1154G
Minimum Possible LCM
|
0 / 0 |
8 |
|
|
30128 |
codeforces#P1155A
Reverse a Substring
|
0 / 0 |
3 |
|
|
30129 |
codeforces#P1155B
Game with Telephone Numbers
|
0 / 0 |
4 |
|
|
30130 |
codeforces#P1155C
Alarm Clocks Everywhere
|
0 / 0 |
4 |
|
|
30131 |
codeforces#P1155D
Beautiful Array
|
1 / 2 |
6 |
|
|
30132 |
codeforces#P1155E
Guess the Root
|
0 / 0 |
8 |
|
|
30133 |
codeforces#P1155F
Delivery Oligopoly
|
0 / 0 |
10 |
|
|
30134 |
codeforces#P1156A
Inscribed Figures
|
0 / 0 |
4 |
|
|
30135 |
codeforces#P1156B
Ugly Pairs
|
0 / 0 |
6 |
|
|
30136 |
codeforces#P1156C
Match Points
|
0 / 0 |
7 |
|
|
30137 |
codeforces#P1156D
0-1-Tree
|
0 / 0 |
8 |
|
|
30138 |
codeforces#P1156E
Special Segments of Permutation
|
0 / 0 |
8 |
|
|
30139 |
codeforces#P1156F
Card Bag
|
0 / 0 |
8 |
|
|
30140 |
codeforces#P1156G
Optimizer
|
0 / 0 |
10 |
|
|
30141 |
codeforces#P1157A
Reachable Numbers
|
0 / 0 |
3 |
|
|
30142 |
codeforces#P1157B
Long Number
|
0 / 0 |
4 |
|
|
30143 |
codeforces#P1157C1
Increasing Subsequence (easy version)
|
0 / 0 |
4 |
|
|
30144 |
codeforces#P1157C2
Increasing Subsequence (hard version)
|
0 / 0 |
5 |
|
|
30145 |
codeforces#P1157D
N Problems During K Days
|
0 / 0 |
6 |
|
|
30146 |
codeforces#P1157E
Minimum Array
|
1 / 5 |
5 |
|
|
30147 |
codeforces#P1157F
Maximum Balanced Circle
|
0 / 0 |
7 |
|
|
30148 |
codeforces#P1157G
Inverse of Rows and Columns
|
1 / 1 |
8 |
|
|
30149 |
codeforces#P1158A
The Party and Sweets
|
0 / 0 |
5 |
|
|
30150 |
codeforces#P1158B
The minimal unique substring
|
0 / 0 |
8 |
|
|
30151 |
codeforces#P1158C
Permutation recovery
|
0 / 1 |
7 |
|
|
30152 |
codeforces#P1158D
Winding polygonal line
|
1 / 1 |
10 |
|
|
30153 |
codeforces#P1158E
Strange device
|
0 / 0 |
10 |
|
|
30154 |
codeforces#P1158F
Density of subarrays
|
0 / 0 |
10 |
|
|
30155 |
codeforces#P1159A
A pile of stones
|
1 / 3 |
3 |
|
|
30156 |
codeforces#P1159B
Expansion coefficient of the array
|
0 / 0 |
4 |
|
|
30157 |
codeforces#P1160A2
Collaboration
|
0 / 0 |
(无) |
|
|
30158 |
codeforces#P1162A
Zoning Restrictions Again
|
1 / 1 |
3 |
|
|
30159 |
codeforces#P1162B
Double Matrix
|
0 / 0 |
4 |
|
|
30160 |
codeforces#P1163A
Eating Soup
|
0 / 0 |
3 |
|
|
30161 |
codeforces#P1163B1
Cat Party (Easy Edition)
|
1 / 2 |
5 |
|
|
30162 |
codeforces#P1163B2
Cat Party (Hard Edition)
|
0 / 0 |
5 |
|
|
30163 |
codeforces#P1163C1
Power Transmission (Easy Edition)
|
0 / 0 |
6 |
|
|
30164 |
codeforces#P1163C2
Power Transmission (Hard Edition)
|
0 / 0 |
6 |
|
|
30165 |
codeforces#P1163D
Mysterious Code
|
0 / 0 |
7 |
|
|
30166 |
codeforces#P1163E
Magical Permutation
|
0 / 0 |
9 |
|
|
30167 |
codeforces#P1163F
Indecisive Taxi Fee
|
1 / 2 |
10 |
|
|
30168 |
codeforces#P1165A
Remainder
|
0 / 0 |
3 |
|
|
30169 |
codeforces#P1165B
Polycarp Training
|
0 / 1 |
3 |
|
|
30170 |
codeforces#P1165C
Good String
|
0 / 0 |
4 |
|
|
30171 |
codeforces#P1165D
Almost All Divisors
|
0 / 0 |
5 |
|
|
30172 |
codeforces#P1165E
Two Arrays and Sum of Functions
|
0 / 0 |
5 |
|
|
30173 |
codeforces#P1165F1
Microtransactions (easy version)
|
0 / 0 |
7 |
