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
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | jiangly | 3976 |
| 2 | tourist | 3815 |
| 3 | jqdai0815 | 3682 |
| 4 | ksun48 | 3614 |
| 5 | orzdevinwang | 3526 |
| 6 | ecnerwala | 3514 |
| 7 | Benq | 3482 |
| 8 | hos.lyric | 3382 |
| 9 | gamegame | 3374 |
| 10 | heuristica | 3357 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 168 |
| 2 | -is-this-fft- | 165 |
| 3 | atcoder_official | 161 |
| 3 | Um_nik | 161 |
| 5 | djm03178 | 157 |
| 6 | Dominater069 | 156 |
| 7 | adamant | 154 |
| 8 | luogu_official | 152 |
| 9 | awoo | 151 |
| 10 | TheScrasse | 147 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2025 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Jan/19/2025 12:11:47 (j1).
Desktop version, switch to mobile version.
Supported by
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.