Обсуждение @ 1017. Лестницы @ Timus Online Judge

The best solution! Only 0.015 sec and 78 Kb!

Послано FANTOM 3 апр 2005 04:23

My solution is fast! valery@uni.lg.ua

Re: The best solution! Only 0.015 sec and 78 Kb!

Послано 12345 3 апр 2005 04:33

Ha!
My solution: only 0.001 sec and 70 Kb!
And it's normal solution (no cheating).
I sent it some minutes ago.

PS: It's very good that your solution works fast but
Always there is better one :)

Re: The best solution! Only 0.015 sec and 78 Kb!

Послано FANTOM 3 апр 2005 04:58

Ha-Ha! My solution works sometimes too 0.001, but how many iterations of your cycle on N=500?

Re: The best solution! Only 0.015 sec and 78 Kb!

Послано 12345 3 апр 2005 15:21

Ha-ha-ha!
My solution is O(n^2) but I know O(sqrt(n)*n) one.

Stop arguing :)

Послано UdSU 2 май 2005 17:30

My solution is O(1) :)

Your solution is just precalc, but there is correct O(N*sqrt(N)) solution (-)

Послано Dmitry 'Diman_YES' Kovalioff 2 май 2005 20:01

need help

Послано Saurav Kumar 11 июл 2016 03:55

sorry to bother u on such an old post...but can u help me on a better approach to this question

Re: The best solution! Only 0.015 sec and 78 Kb!

Послано Faria Efa 10 дек 2020 11:53

my solution is O(0) :)

Jokes on you!

Послано Ziad Ismaili Alaoui 19 янв 2021 19:22

Jokes on you! My solution is O(-∞)

Re: Jokes on you!

Послано Eusebiu_distrugatorul 10 июн 2021 13:10

So, your solution travels back in time or make the time in the Universe acting backwards?:)

Обсуждение задачи 1017. Лестницы