Problem
Given a non-negative integer N and two digits A, B (0-9, A ≠ B), replace all occurrences of digit A in N with digit B using recursion and print the result as an integer.
Input format
Input
input.txt
- Three integers: N (0 ≤ N ≤ 100000), A, B (0 ≤ A, B ≤ 9, A ≠ B)
Output format
Output
output.txt
- Resulting integer after replacement
Example
input
2323 3 9
output
2929
💬 Discussion
Loading...💬
No comments yet. Be the first to start the discussion!
💻 No output yet.
Click Run in the editor to execute your code with the custom input.
Sample cases (from the problem)
Sample Case 1
Input
2323 3 9
Expected output
2929
Solve it your way first
Community solutions unlock after you submit a passing solution. Don't peek.
Ready to solve this challenge?
Create a free account to write code, submit solutions, and track your progress.
⌨️ Keyboard Shortcuts
Code Editor
Run Code
Ctrl
Enter
Submit Code
Ctrl
Shift
Enter
Format Code
Shift
Alt
F
Toggle Comment
Ctrl
/
Undo
Ctrl
Z
Redo
Ctrl
Y
Navigation
Global Search
/
Show Shortcuts
?
Close Modal
Esc