|
|
вернуться в форумBrute-force approach using BigInteger in Java exceeds time limit in test#13. Can anybody give a hint, please? Thanks. 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 Chinese Remainder Theorem does the trick. |
|
|