| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3773 |
| 3 | Radewoosh | 3646 |
| 4 | ecnerwala | 3624 |
| 5 | jqdai0815 | 3620 |
| 5 | Benq | 3620 |
| 7 | orzdevinwang | 3612 |
| 8 | Geothermal | 3569 |
| 8 | cnnfls_csy | 3569 |
| 10 | gyh20 | 3447 |
| # | User | Contrib. |
|---|---|---|
| 1 | awoo | 161 |
| 2 | maomao90 | 160 |
| 3 | cry | 158 |
| 4 | atcoder_official | 156 |
| 4 | nor | 156 |
| 6 | -is-this-fft- | 155 |
| 7 | maroonrk | 153 |
| 7 | adamant | 153 |
| 7 | Um_nik | 153 |
| 10 | djm03178 | 146 |
Recently I was studying math and came across this problem:
Given 1 < a < 10, 1 <= n <= 100000, show how to compute the value of: 1 * a + 2 * a^2 + 3 * a^3 + ... + n * a^n efficienty, i.e. in O(log n)!
Could someone give ideas/way to solve this problem?
