Introduction
The best bet for Julia to do is to try to work on some coding, go back to basics, and work out the sample test case first.
In other words, only work on the subproblem,
1. b0 /(n + a1)(n + a2)
2. (b0 + b1 n)/(n + a1)(n + a2)(n + a3).
Saturday, June 10, 2017
Rational Sums - Ad Infinitum18
June 10, 2017
The problem statement is here. The algorithm is expert level. Now it is 10:45 pm, Julia plans to work on the contest in next 90 minutes. She studied the algorithm problem statement more than 30 minutes, she fully understood the problem.
The best bet for Julia to do is to try to work on some coding, go back to basics, and work out the sample test case first.
In other words, only work on the subproblem,
1. b0 /(n + a1)(n + a2)
2. (b0 + b1 n)/(n + a1)(n + a2)(n + a3).
The best bet for Julia to do is to try to work on some coding, go back to basics, and work out the sample test case first.
In other words, only work on the subproblem,
1. b0 /(n + a1)(n + a2)
2. (b0 + b1 n)/(n + a1)(n + a2)(n + a3).
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment