|
|
вернуться в форум
Edited by author 11.11.2010 07:28 Of course, it's slow! BigIntegers are not allowed in this problem!
And replace your precalculations by while cycle and in k-based numeral system!
Edited by author 07.11.2010 13:42
Edited by author 11.11.2010 07:28 AC dont use ArrayList for adding two big numbers just used array (in java) thanks If you have TLE#11 consider to use not "one byte per one digit" representation, but rather one 16/32 bit int per group of digits. Another hint: when you sum all digits in your next fibonacci number and use 16-24 bits per group approach, you can precalculate sum of digits in every possible of such groups before the main loop. |
|
|
