Given a string S. How many permutations of string s is lexicographically smaller than S . If S = "cda" answer will be 2 . And the strings ar {"acd","adc"}.
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | maomao90 | 163 |
2 | Um_nik | 163 |
4 | atcoder_official | 161 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | nor | 153 |
9 | Dominater069 | 153 |
Permutations
Given a string S. How many permutations of string s is lexicographically smaller than S . If S = "cda" answer will be 2 . And the strings ar {"acd","adc"}.
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en3 | LIFE_GOES_ON | 2020-06-27 05:39:36 | 8 | |||
en2 | LIFE_GOES_ON | 2020-06-26 23:19:26 | 2 | Tiny change: 'strings ar {"acd","a' -> 'strings are {"acd","a' | ||
en1 | LIFE_GOES_ON | 2020-06-26 23:15:08 | 169 | Initial revision (published) |
Name |
---|