Can anyone please provide any hint for this problem? Throwing Dice
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3947 |
2 | jiangly | 3734 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | ecnerwala | 3581 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | ksun48 | 3479 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | awoo | 162 |
2 | maomao90 | 160 |
3 | nor | 156 |
4 | cry | 155 |
4 | adamant | 155 |
4 | atcoder_official | 155 |
4 | -is-this-fft- | 155 |
8 | maroonrk | 153 |
9 | SecondThread | 147 |
10 | Petr | 146 |
Can anyone please provide any hint for this problem? Throwing Dice
Название |
---|
Let f(n) be the number of ways of throwing dices to get a sum of n, Then consider the last dice throw. It has 6 possibilities 1-6. So f(n) = f(n-1) + f(n-2) + ... + f(n-6).
The recurrence is correct. However, unfortunately, it TLE's. There is hope though. This is a linear recurrence can be computed for arbitrary values of n using fast matrix exponentiation. Here is a geeks for geeks article that illustrates the technique in action https://www.geeksforgeeks.org/find-nth-term-a-matrix-exponentiation-example/
My fav trick in such problems:
1. precalc first 20 values
2. use Berlekamp-Massey algorihm to compute n_th value of Linear recurrence
source: https://codeforces.com/blog/entry/61306?
another problems:
https://codeforces.com/contest/392/submission/51596991
https://codeforces.com/contest/678/submission/51597127