|
|
back to boardTLE 13: How to optimize? Brute-force approach using BigInteger in Java exceeds time limit in test#13. Can anybody give a hint, please? Thanks. Re: TLE 13: How to optimize? I know there are some rules for modulo by 3 or 5. I'm not sure applying only those two rules will help. Or are there are generic rule for modulo by prime numbers? Edited by author 04.02.2014 03:20 Re: TLE 13: How to optimize? Re: TLE 13: How to optimize? Posted by mikroz 28 Jul 2014 22:19 Chinese Remainder Theorem does the trick. |
|
|