|
|
back to boardGreat Problem! :-) I'd like to thank authors for this problem - it became one of my favorite on Timus! Thanks again for very interesting problem! :-) Re: Great Problem! :-) what is that can you tell me what problem it is Re: Great Problem! :-) It's the one that is in the caption of this message :-) It's 1324. Re: Great Problem! :-) Yeah.. But limits could be higher... What about 10^20? :) Re: Great Problem! :-) 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. |
|
|