Обсуждение @ 1324. Лишние пробелы @ Timus Online Judge

Ostap Korkuna (Lviv NU) Great Problem! :-) [4] // Задача 1324. Лишние пробелы 31 янв 2007 18:04

I'd like to thank authors for this problem - it became one of my favorite on Timus!
Thanks again for very interesting problem!
:-)

nttjuvwamsncc Re: Great Problem! :-) [3] // Задача 1324. Лишние пробелы 1 фев 2007 18:43

what is that
can you tell me what problem it is

Ostap Korkuna (Lviv NU) Re: Great Problem! :-) [2] // Задача 1324. Лишние пробелы 2 фев 2007 02:16

It's the one that is in the caption of this message :-)
It's 1324.

Denis Koshman Re: Great Problem! :-) [1] // Задача 1324. Лишние пробелы 28 июл 2008 20:14

Yeah.. But limits could be higher... What about 10^20? :)

ARK (***AESC_USU***) Re: Great Problem! :-) // Задача 1324. Лишние пробелы 18 янв 2018 07:16

Or even 10^33. 64-bit integer is still enough (for answer, not for input, but we can just ignore too long input).
Or even 10^{10^4}. Works for naive long multiplication.
Or even 10^{10^5}. Works in 0.3 in python (only 8 lines!).
Or even 10^{10^6}. Hello, FFT!

For problem can be solved in T(n), where n = length of input, T(n) is time of multiplication.

Обсуждение задачи 1324. Лишние пробелы