Recursive Sum

Given a whole number, print it’s recursive sum.

Unsolved

Given n, take the sum of the digits of n. If that value has more than one digit, continue reducing in this way until a single-digit number is produced.


Inputs

value1

A whole number.

Sample Test Cases

Sample Input 1

value1: 1919
output: 2

Test Results

Login/Register

At the moment only Discord login is supported.

Login with Discord