oos1111's blog

By oos1111, history, 2 years ago, In English,

I got stuck at the problem 444B DZY Loves FFT and I read the editorial.
And I really don't understand how to calculate the expected time complexity of the whole algorithm. How to prove that the worst expected number of operations is around ten million? Please help!

  • Vote: I like it
  • +5
  • Vote: I do not like it