Given a number n, how to perform atmost k swap operations on number's digits to get the largest number. Ex- n=7899, k=2 ans=9987
№ | Пользователь | Рейтинг |
---|---|---|
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 | 165 |
3 | adamant | 161 |
4 | TheScrasse | 160 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | orz | 146 |
9 | SecondThread | 145 |
9 | pajenegod | 145 |
Given a number n, how to perform atmost k swap operations on number's digits to get the largest number. Ex- n=7899, k=2 ans=9987
Название |
---|
do you mean if number is say 12345 and swaps = 2 , then find largest number ? your question format is very bad
yeah
Auto comment: topic has been updated by code_fille (previous revision, new revision, compare).
Doesn't it look like bruteforce? I mean the for n <= 10^18, and k small enough (does big K even make sense?)