Hi Folks,I am learning competitive programming now a days.I have started solving recursion/dp based problems.I am trying this problem link. Please help me to find out recursion in the above problem.
Thanks
→ Обратите внимание
→ Трансляции
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 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 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 164 |
| 1 | maomao90 | 164 |
| 3 | Um_nik | 163 |
| 4 | atcoder_official | 160 |
| 4 | adamant | 160 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 8 | Dominater069 | 154 |
| 8 | nor | 154 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 14.11.2024 19:52:22 (k2).
Десктопная версия, переключиться на мобильную.
При поддержке
It is not a DP problem. Find the leftmost digit that is unlucky. If there is such a digit let its position be i. If the digit is less than 3 then make it 3 and fill all positions on the right with 3s. Otherwise, if it is less than 5 then make it 5 and fill the positions on the right with 3s. If the digit is greater than 5 find the rightmost 3 on its left at position j. Make this 3 a 5 and fill the positions on its right with 3s. If there is no such 3, then print s+1 3s where s is the length of N. If there is no unlucky digit find the last 3, change it to 5 and fill the positions on its right with 3s. If there is no 3 then print s+1 3s.