http://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?
# | User | Rating |
---|---|---|
1 | ecnerwala | 3649 |
2 | Benq | 3581 |
3 | orzdevinwang | 3570 |
4 | Geothermal | 3569 |
4 | cnnfls_csy | 3569 |
6 | tourist | 3565 |
7 | maroonrk | 3531 |
8 | Radewoosh | 3521 |
9 | Um_nik | 3482 |
10 | jiangly | 3468 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 161 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 151 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
http://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://codeforces.com/contest/180/problem/C there is no editorial for it. thanks for helping. i already soled it other way.
Name |
---|