| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3741 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3489 |
| 7 | Radewoosh | 3483 |
| 8 | Kevin114514 | 3443 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 158 |
| 5 | -is-this-fft- | 158 |
| 7 | awoo | 156 |
| 8 | djm03178 | 155 |
| 9 | TheScrasse | 154 |
| 10 | Dominater069 | 153 |
How to get recurrence formula of an array by it's generating function
zscoder introduced Generating functions in Competitive Programming in his blog, which give a method to get the formula of general term by it's generating function.
But sometime the generating function is somewhat complicated, for instance, the array http://oeis.org/A054726 which has generating function:
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en4 |
|
jianglyFans | 2020-07-25 06:37:06 | 42 | ||
| en3 |
|
jianglyFans | 2020-07-25 06:24:18 | 1362 | ||
| en2 |
|
jianglyFans | 2020-07-24 14:57:03 | 385 | Tiny change: 'ction:\n\n3232\n\frac{3}{2}\n\n\n\n' -> 'ction:\n\n$$\n\frac{3}{2}\n$$\n\n\n' (published) | |
| en1 |
|
jianglyFans | 2020-07-24 14:13:19 | 504 | Initial revision (saved to drafts) |
