Rating changes for last rounds are temporarily rolled back. They will be returned soon. ×

Calculating time complexity for CEOI 2018 — Toys (Day 2)

Revision en2, by xennygrimmato, 2018-08-17 09:41:09

I am trying to estimate the upper bound of the time-complexity of this solution by ksun48. Currently, I am assuming the upper bound on the number of divisors of N to be based on this codeforces blog, but that fact doesn't simplify the calculation of time complexity here.

  • Is there a simple way to estimate a good upper bound for this solution?
  • Is there some literature around formally calculating time complexity in such scenarios?
Tags ceoi2018, time-complexity

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English xennygrimmato 2018-08-17 09:41:09 289 Remove incorrect time-complexity calculation
en1 English xennygrimmato 2018-08-17 09:33:24 607 Initial revision (published)