Back
Close

Decrypt the encrypted word in nums

Statement

 Goal

You need to decrypt the given text hidden.

Every two numbers get converted to one character as follows: convert the first number to its name, and then take the character with as index the second number.

For example:
- in case of 32, we convert the 3 into "three" and 2 into r;

The number "99" represents the space ' ' character.
Input
A string hidden which consists of digits between 0 and 9.
Output
A string decrypt which consists of lowercase letters and space(-s).
Constraints
2 ≤ length of hidden ≤ 100
length of hidden is even
Second number in each pair < length of first number written out, or pair is '99'
Example
Input
849390
Output
ten

Game modes
Fastest

Test cases
Test Case 1 (ten) Test
Input
849390
Output
ten

Validator 1 (threw) Validator
Input
8431433321
Output
threw

Test Case 2 (tester) Test
Input
843370208043
Output
tester

Validator 2 (wroth) Validator
Input
2143418431
Output
wroth

Test Case 3 (rewrought) Test
Input
320121324142823120
Output
rewrought

Validator 3 (rottener) Validator
Input
0222843073923302
Output
rottener

Test Case 4 (our strength) Test
Input
414243996084431274822083
Output
our strength

Validator 4 (who won thereon) Validator
Input
218322992110749984831243714190
Output
who won thereon

Solution language

Solution

Stub generator input