ENG  RUSTimus Online Judge
Online Judge
Problems
Authors
Online contests
About Online Judge
Frequently asked questions
Site news
Webboard
Links
Problem set
Submit solution
Judge status
Guide
Register
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
back to board

Discussion of Problem 1120. Sum of Sequential Numbers

You can get it in just about O(sqrt(n))
Posted by nickolas stoudemire 22 Aug 2007 14:42
You can prove it with the knowledge of maths.

Edited by author 22.08.2007 14:43
Re: You can get it in just about O(sqrt(n))
Posted by Egor Stepanov [mikroz] 16 Dec 2008 04:17
Yeah!
Re: You can get it in just about O(sqrt(n))
Posted by Damir Garifullin[SPb NRU ITMO] 14 Nov 2012 00:18
There is more strong aproximation. O(n^1/3)