Recursive digit sum EASY Recursivitate (BAC) Subprograme (BAC) 10 XP 0 solved
Mobile coding works. A laptop is faster for long sessions.

Problem

Read a natural number `n` and print the sum of its digits, computed using **a recursive function**. Iterative solutions (with `while`/`for`) are not accepted; an explicitly self-calling function must be defined. Define a recursive function `sumDigits(n)` that returns the digit sum of `n`. The function must use the relation: ``` sumDigits(0) = 0 sumDigits(n) = n % 10 + sumDigits(n / 10), for n > 0 ```

Input format

Input input.txt

The program reads from standard input a single natural number `n`. - `0 <= n <= 1.000.000.000` - The implementation must be recursive (define and call a self-calling function).

Output format

Output output.txt

The program prints to standard output a single natural number: the digit sum of `n`, followed by a newline.

Example

input
12345
output
15

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

🔍 Interactive Debugger

0 / 0

Analyzing your code...

📦 Variables

No variables yet

📚 Call Stack
main() line 1
📤 Output
We use cookies

Essential cookies are always active. You can choose to enable preference and analytics cookies. Learn more