http://mirror.codeforces.com/contest/472/problem/C
i dont understand the second test case. whatever handle we choose, the order will always be 2 3 1, the how the answer for 3 1 2 can be yes?
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
8 | ecnerwala | 3494 |
9 | Um_nik | 3396 |
10 | gamegame | 3386 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | Um_nik | 164 |
2 | -is-this-fft- | 161 |
3 | maomao90 | 159 |
3 | atcoder_official | 159 |
5 | cry | 158 |
5 | awoo | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 153 |
10 | Dominater069 | 152 |
http://mirror.codeforces.com/contest/472/problem/C
i dont understand the second test case. whatever handle we choose, the order will always be 2 3 1, the how the answer for 3 1 2 can be yes?
It is possible to write five as a sum in exactly six different ways:
4 + 1 3 + 2 3 + 1 + 1 2 + 2 + 1 2 + 1 + 1 + 1 1 + 1 + 1 + 1 + 1
How many different ways can one hundred be written as a sum of at least two positive integers?
i am looking for a top-down recursive solution. thanx.
i want to solve this problem with DP http://mirror.codeforces.com/contest/180/problem/C there is no editorial for it. thanks for helping. i already soled it other way.
Название |
---|