Can anyone give me some ideas for the following problem? http://lightoj.com/volume_showproblem.php?problem=1095
Can anyone give me some ideas for the following problem? http://lightoj.com/volume_showproblem.php?problem=1095
# | User | Rating |
---|---|---|
1 | ecnerwala | 3650 |
2 | Benq | 3582 |
3 | Geothermal | 3570 |
3 | orzdevinwang | 3570 |
5 | cnnfls_csy | 3569 |
6 | tourist | 3565 |
7 | maroonrk | 3532 |
8 | Radewoosh | 3522 |
9 | Um_nik | 3483 |
10 | jiangly | 3468 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 163 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 151 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
Name |
---|
The solution idea comes from dearrangement. At a time from first m integer you have to dearrange (m-k) integer. And also from (m+1)'th to n'th integer you can dearrange them or not. So iterate over (n-m) and for every time suppose i you keep them at their position, so you have (n-k-i) integer which you can dearrange. Add those ways in every iteration. And at last multiply with mCk
Hi adamantium ,Can u provide your solution plz?
http://paste.ubuntu.com/24211669/
Thank u...