ENG  RUSTimus Online Judge
Online Judge
Problems
Authors
Online contests
About Online Judge
Frequently asked questions
Site news
Webboard
Links
Problem set
Submit solution
Judge status
Guide
Register
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
back to board

Discussion of Problem 1803. The Czechs' Rifles

TL11
Posted by Ibragim Atadjanov (Tashkent U of IT) 7 Nov 2010 07:04


Edited by author 11.11.2010 07:28
Re: TL11
Posted by Moonstone [Samara SAU] 7 Nov 2010 13: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
still got tl11
Posted by Ibragim Atadjanov (Tashkent U of IT) 8 Nov 2010 21:04


Edited by author 11.11.2010 07:28
Re: still got tl11
Posted by Ibragim Atadjanov (Tashkent U of IT) 11 Nov 2010 07:24
AC dont use ArrayList for adding two big numbers just used array (in java)
Re: TL11
Posted by Ibragim Atadjanov (Tashkent U of IT) 11 Nov 2010 07:29
thanks
Re: TL11
Posted by Kolyanich 15 Feb 2011 04:52
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.