wip

71. Decode 1

Time Limit: 1 seconds

Memory Limit: 1024 MB

Rating: 1000

You and your friends have discovered a long list of numbers on a scroll. By decoding the scroll, you can find a secret code. In the list of numbers, find the exact position of the 9 digit number with no repeating digits. Split the 9 digit number into 4 individual denary numbers, using digit 1 and 2 followed by 3 and 4 followed by 5 and 6 followed by 7, 8 and 9. Convert these denary numbers into ASCII and output it to solve.

Inputs from the list of codes will come in the form n, where n is a 9 digit number. Inputs will come in the form 'n', 'n'. A string including values in single quotations separated by commas, with a space in between the comma and the next value.

Output should come in a single string. For example, if the positions with no repeating digits in the code read 768352194, output should be 'LS4Â'.

Sample Input 0:
'581316223', '515685155', '594867123', '845964285'

Sample Output 0:
;0C{

The 3rd string of numbers is has no repeating digits. In the string: 59 = ; 48 = 0 67 = C 123 = { Therefore the converted string is ;0C{ .

KL Coding Cup October 2024 > Problem 9