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"}.
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3690 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 162 |
4 | TheScrasse | 159 |
5 | nor | 157 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | orz | 146 |
9 | Petr | 145 |
9 | pajenegod | 145 |
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. | Язык | Кто | Когда | Δ | Комментарий | |
---|---|---|---|---|---|---|
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) |
Название |
---|