|
|
30091 |
codeforces#P1148E
Earth Wind and Fire
|
0 / 0 |
8 |
|
|
30095 |
codeforces#P1149A
Prefix Sum Primes
|
0 / 0 |
4 |
|
|
30098 |
codeforces#P1149D
Abandoning Roads
|
0 / 0 |
10 |
|
|
30100 |
codeforces#P1150A
Stock Arbitraging
|
0 / 0 |
3 |
|
|
30101 |
codeforces#P1150B
Tiling Challenge
|
0 / 0 |
3 |
|
|
30105 |
codeforces#P1151D
Stas and the Queue at the Buffet
|
0 / 0 |
5 |
|
|
30108 |
codeforces#P1152A
Neko Finds Grapes
|
0 / 0 |
3 |
|
|
30111 |
codeforces#P1152D
Neko and Aki's Prank
|
0 / 0 |
7 |
|
|
30116 |
codeforces#P1153B
Serval and Toy Bricks
|
0 / 0 |
4 |
|
|
30117 |
codeforces#P1153C
Serval and Parenthesis Sequence
|
0 / 0 |
5 |
|
|
30118 |
codeforces#P1153D
Serval and Rooted Tree
|
0 / 0 |
6 |
|
|
30124 |
codeforces#P1154D
Walking Robot
|
0 / 0 |
5 |
|
|
30126 |
codeforces#P1154F
Shovels Shop
|
0 / 0 |
7 |
|
|
30127 |
codeforces#P1154G
Minimum Possible LCM
|
0 / 0 |
8 |
|
|
30129 |
codeforces#P1155B
Game with Telephone Numbers
|
0 / 0 |
4 |
|
|
30131 |
codeforces#P1155D
Beautiful Array
|
1 / 2 |
6 |
|
|
30135 |
codeforces#P1156B
Ugly Pairs
|
0 / 0 |
6 |
|
|
30136 |
codeforces#P1156C
Match Points
|
0 / 0 |
7 |
|
|
30140 |
codeforces#P1156G
Optimizer
|
0 / 0 |
10 |
|
|
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 |
|
|
30149 |
codeforces#P1158A
The Party and Sweets
|
0 / 0 |
5 |
|
|
30151 |
codeforces#P1158C
Permutation recovery
|
0 / 1 |
7 |
|
|
30152 |
codeforces#P1158D
Winding polygonal line
|
1 / 1 |
10 |
|
|
30159 |
codeforces#P1162B
Double Matrix
|
0 / 0 |
4 |
|
|
30160 |
codeforces#P1163A
Eating Soup
|
0 / 0 |
3 |
|
|
30169 |
codeforces#P1165B
Polycarp Training
|
0 / 1 |
3 |
|
|
30170 |
codeforces#P1165C
Good String
|
0 / 0 |
4 |
|
|
30172 |
codeforces#P1165E
Two Arrays and Sum of Functions
|
0 / 0 |
5 |
|
|
30173 |
codeforces#P1165F1
Microtransactions (easy version)
|
0 / 0 |
7 |
|
|
30174 |
codeforces#P1165F2
Microtransactions (hard version)
|
0 / 0 |
7 |
|
|
30175 |
codeforces#P1166A
Silent Classroom
|
0 / 0 |
3 |
|
|
30178 |
codeforces#P1166D
Cute Sequences
|
0 / 0 |
8 |
|
|
30181 |
codeforces#P1167A
Telephone Number
|
1 / 1 |
3 |
|
|
30184 |
codeforces#P1167D
Bicolored RBS
|
0 / 0 |
5 |
|
|
30188 |
codeforces#P1168A
Increasing by Modulo
|
0 / 0 |
5 |
|
|
30200 |
codeforces#P1170F
Wheels
|
0 / 0 |
(无) |
|
|
30204 |
codeforces#P1172A
Nauuo and Cards
|
0 / 2 |
6 |
|
|
30211 |
codeforces#P1173A
Nauuo and Votes
|
1 / 1 |
3 |
|
|
30212 |
codeforces#P1173B
Nauuo and Chess
|
0 / 0 |
3 |
|
|
30213 |
codeforces#P1174A
Ehab Fails to Be Thanos
|
0 / 0 |
3 |
|
|
30221 |
codeforces#P1175C
Electrification
|
0 / 0 |
5 |
|
|
30222 |
codeforces#P1175D
Array Splitting
|
0 / 0 |
6 |
|
|
30223 |
codeforces#P1175E
Minimal Segment Cover
|
1 / 1 |
8 |
|
|
30226 |
codeforces#P1176A
Divide it!
|
1 / 1 |
3 |
|
|
30228 |
codeforces#P1176C
Lose it!
|
0 / 0 |
4 |
