Comments
0

Can you post your solutions on pastebin for all problems please? I am curios about some of them.
+1

First of all, the maximum size is k + 1, where k is the maximum number such that l * 2 ^ k <= r. Now i want to see what is the maximum number val_left_2 >=l, for which we have val_left * 2 ^ k <= r. This can be done with binary search or math. We have to observe that we can use multiplication by 3 or 2 from the previous number that is in the set, because for numbers greater or equal than 4 you decrease automatically the size of the maximum set, because you use in one operation at least 2 multiplication by 2. We alse have to observe that we can use multiplication by 3 just one time, because if we use 2 times, 3 * 3 = 9, and 2 ^ 3 = 8 < 9, so we also decrease the size of the maximum set. We have to find again using bynary search or math what is the greatest number val_left_3 >= l such that multiplying it just one time by 3 and after that just only by 2, the set has the same size. Suppose the maximum size is k. For numbers that we can multiply by 3 we have k — 1 possible answers, because we can use multiplication with 3 once time in position 2, 3, .. k. Suppose that we have the following example: l = 1, r = 12. We have k = 3(1 * 2 ^ 3 <= 12), so the size is 4. Now we can have the following sets: (1, 3, 6, 12), (1, 2, 6, 12), (1, 2, 4, 12). See that we chose to multiply by 3 at each set the number on the second, third, or fourth position. So the final answer is: (val_left_2 — l + 1) + (k — 1) * (val_left_3 — l + 1). I hope that you understand!
+2

Very nice contest! Congrats to the authors! I really enjoyed A-D, but didn't come up with one solution for D! Can anyone tell his solution?
0

Can anyone explain E for noobs?
-6

Very nice contest! Congrats to the authors!
On n0sk1ll → Hello 2023, 3 years ago
+1

Great contest and amazing problems! Congrats to the author!
+3

I hope all wanna see that!
0

Great contest!Congrats to the authors!Cool problem D, unfortunately I didn't solve it.I'm waiting for editoiral!Thanks!
On adimiclaus15 → FMI No Stress 11, 4 years ago
+6

Great contest!Congrats to the authors!
+9

Very amazing contest!Congrats to the authors!
+22

Great contest!Congrats to authors!
0

All people now looking at standings and waiting to do another things xd!
On 055D → Codeforces Round #821 (Div. 2), 4 years ago
0

Very nice problems!I have really enjoyed C!Congratulations to authors!
On Aris → Codeforces Round #820 (Div. 3), 4 years ago
0

Very interesting problems, especially F!I have really enjoyed it!
0

Very nice problems A B C!
+5

Very goood problems A, B, C!
-34

Wtf problem F sick implementation?!Stop proposing this kind of problems!
+8

Very nice problems!Congrats to authors!
+12

Congratulations to authors for problem H!Very interesting!
+4

The pretests have been made stronger (specifically, more pretests have been included).Are you sure for problem B?:(