How can I find the 1000th permutation of 50!. Using Backtrack i can easily find the 100th permutation of 5! or 5th permutation of 3! which is 3 1 2.
# | User | Rating |
---|---|---|
1 | tourist | 3993 |
2 | jiangly | 3743 |
3 | orzdevinwang | 3707 |
4 | Radewoosh | 3627 |
5 | jqdai0815 | 3620 |
6 | Benq | 3564 |
7 | Kevin114514 | 3443 |
8 | ksun48 | 3434 |
9 | Rewinding | 3397 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 156 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
10 | nor | 152 |
How can I find the 1000th permutation of 50!. Using Backtrack i can easily find the 100th permutation of 5! or 5th permutation of 3! which is 3 1 2.
Name |
---|
Assume that you have to find the K-th permutation with N elements. With fixed first element you can rearrange the other elements in (N-1)! ways. Now you can easily find the first element in the K-th permutation. Then do the same with the second element, and then with the third and so on.
Cantor expansion?
What does it mean? I'm sorry, but I can't understand.
https://swiyu.wordpress.com/2012/10/11/find-all-permutation-find-kth-permutation/
http://ideone.com/yP5KuJ
for understanding refer to Factorial number system Wiki page Complexity (n lg(n)^2 )