It almost the same: find sum from 1 to n, is it?

Got so used to following the standard procedure for you normal binary/hex conversions, this one really made me think about how the math works and how to get from a to b. Was frustrating, but fun!

Hint: for a more general example, take a look at Excel numeration system.

Done in Rust and Go translations.

• Rust translation
• Go translation

Approved :)

'could be interesting to have the sample tests split in 2 different sections: one for encoding, and the other for decoding. It's a bit more comfortable for the user.

Clever, though inefficient (conversion takes too much time).

How?

C translation (author gone)

Python translation (author gone)

did you include using System.Text.RegularExpressions;?

This kata is an easier version of the kata in your link. It is not a duplicate. I will close this issue if I don't find any kata with the same requirements as this kata.

Duplicate of T.T.T.38: The sum of each digits