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 1167. Bicolored Horses

So why n^3 algo can finish in 0.078s?
Posted by tiancaihb 8 Oct 2009 05:01
My state is f(n,k) so it's obviously a n^3 algo. And the code is very short. But it works fast... Why?
Re: So why n^3 algo can finish in 0.078s?
Posted by Mahammad Valiyev 22 Apr 2013 10:25
Bceause you can do almost 100*10^8 operations in 1 sec :)
Re: So why n^3 algo can finish in 0.078s?
Posted by sylap 18 Jun 2013 13:47
Are you sure ? 10 milliards ? or 100 millions ?