### wuhudsm's blog

By wuhudsm, history, 3 months ago,

A

Idea:Yugandhar_Master

solution
code(C++)

B

Idea:Yugandhar_Master

solution
code(C++)

C

Idea:Yugandhar_Master

solution
code(C++)

D

Idea:Yugandhar_Master

solution
code(C++)

E

Idea:Yugandhar_Master

solution
code(C++)

F

Idea:Yugandhar_Master

solution
code(C++)

G

Idea:Yugandhar_Master

solution
code(C++)
• +15

 » 3 months ago, # |   +5 good-forces but not very good editorials
 » 3 months ago, # |   0 Hey, is it possible to give access to check other's submissions? I am finding it difficult to solve problem C even after reading the editorial.
•  » » 3 months ago, # ^ |   0 Added the solutions, check them out!
 » 3 months ago, # |   0 Auto comment: topic has been updated by Yugandhar_Master (previous revision, new revision, compare).
 » 3 months ago, # |   0 Still can't understand problem C, anyone can explain it please? Why is log2(n) + 1 the lower bound for the sum? and how can one come up with such answer?
•  » » 3 months ago, # ^ | ← Rev. 3 →   +8 Let's consider an integer x, the minimum floor value we can get from x by dividing with one of the lesser value than x is 1(which is trivial), so think of that minimum value y which is less than x and gives 1 when divides x , next move to y-1 and repeat this process until you reach 1. If you observe carefully this process repeats log2(n)+1 times where everytime we get the answer 1 hence from this construction we will get the F(p)=log2(n)+1. Why this is lower bound? (this is proved with some induction in editorial).
 » 3 months ago, # |   0 hi can anyone take time to see my try for E , why i have a runtime error , I used binary lifting , but i am missing on something : https://codeforces.com/gym/105137/submission/259284000
 » 12 days ago, # |   0 hey! I have tried E and its giving RE on TC4.Code here is the code to my solution if someone can help.
•  » » 12 days ago, # ^ |   0 You initialised ans vector with size n+1, but actually your ans vector have to answer for m answers check it!
•  » » » 12 days ago, # ^ |   0 ya mb thanks :)