|
|
Hey,
do the guys that submit on Java use BigInteger and array of (2 x BigInteger)[2000][1000]?
If yes, then how do they manage to pass the TL? Is it just a matter of Java optimization, or the solution is much harder than a simple DP?
Thanks !
Edited by author 07.04.2012 06:11 It's more of a math problem than DP...
If you find the right pattern the solution is pretty simple and no optimization trick is needed to pass time limit.
good luck! These tests helped me to avoid WA#3:
5 3 18
Answer: 9536936874307/3814697265625
12 10 18
Answer: 156154632268249/25389989167104
Edited by author 23.08.2008 13:26 Thank you! Very helpful to debug :) I had problem with Test 3 too. But test that help me is
10000 10000 1 |
|
|
