Обсуждение @ 1595. Совершенная последовательность @ Timus Online Judge

Online Judge

Задачи

Авторы

Соревнования

how it can be solved in 0.062?

Послано Alexander Kouprin 3 авг 2009 03:23

I had found O(n) solution but I need to out ~2.7 Mb. It's takes ~0.12 sec.

So, how this problem can be solved in 0.062?

Re: how it can be solved in 0.062?

Послано Alexander Kouprin 5 авг 2009 06:03

So, nobody wants to answer me. It's pity.

Re: how it can be solved in 0.062?

Послано Erop [USU] 9 май 2012 00:15

printf too slow
you can use fwrite(), but first you need to translate the numbers into a string

Re: how it can be solved in 0.062?

Послано Sunnat 4 май 2015 20:37

fwrite() also too slow )))