Comments
+11

I think the formula for f[i] is wrong in the editorial for problem C. Shouldn't it be

f[i] = max(f[i + 1] , f[i + 1] * (1 — p[i] / 100) + c[i]).
+8

Bro this is just asking for downvotes. Delete this before you get more negative contribution
0

Oh I just read the title and answered, didn't notice he was asking about today's B. In that case we need prime factorization

+1

Learn sieve of Eratosthenes. It can detect primes till N in O(N log(log(N))
0

I'm facing problems again, can you fix it
0

Yes it's working now
0

login not working
0

Got it. Thanks
0

"For the rest of the terms, it is easy to observe that the term below is always less than or equal to the corresponding term above since x is added in the calculation.". I can't observe it. Could would explain further
On Wind_Eagle → Congratulations tourist!, 20 months ago
+18

Petition to make the rank name tourist for rating >=4000
0

I'm in
-8

Can someone help me understand the solution for D.Why does there always exist a valid sequence of operations if we can satisfy the conditions for each element independently
On Nanako → Good Bye 2022 -- Editorial, 3 years ago
0

Can someone provide a easir explanation for problem C
+2

Hope they fix it