How to solve it recursively, is it possilbe or not? I tried a long time but dint came up a solution.
Problem Link: https://cses.fi/problemset/task/1636
And what does it mean my this line "the number of distinct ordered ways". It means increaing order or decreasing order?
THanks in Advance
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3757 |
| 2 | jiangly | 3647 |
| 3 | Benq | 3581 |
| 4 | orzdevinwang | 3570 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | Radewoosh | 3509 |
| 8 | ecnerwala | 3486 |
| 9 | jqdai0815 | 3474 |
| 10 | gyh20 | 3447 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 171 |
| 2 | awoo | 165 |
| 3 | adamant | 164 |
| 4 | TheScrasse | 159 |
| 5 | maroonrk | 155 |
| 6 | nor | 154 |
| 7 | -is-this-fft- | 152 |
| 8 | Petr | 147 |
| 9 | orz | 146 |
| 10 | pajenegod | 145 |
Number of distinct ordered ways means order does not matter. For example if sum = 4 then 1 2 1 and 1 1 2 and 2 1 1 is considered same and counted one time. Read this tutorial https://codeforces.com/blog/entry/70018
I'm pretty sure it means the exact opposite.
Please have a look at this. They have illustrated with example. https://cses.fi/problemset/task/1636
Can anyone give me the recursive solution of the problem?
Check this out: https://codeforces.com/blog/entry/70018
To anyone else, having confusion with "the number of distinct ordered ways", it means the ordered ways to use the available coins. For example, given coins = [2,3,5] Coin 2 must be used before 3, 3 before 5 and so on. So: 2 + 3 + 5 and 2 + 2 + 3 is acceptable, But 2 + 3 +2 is Not. and you have to find distinct ways order ways to find answer this way. Hope this helps.