Decoding

The decoding of a natural number n is a string of characters such that
every two digits of n represent a character. For example, the decoding
of n = 6568 is AD, because the ASCII code of the character A is 65 and
the ASCII character of the character D is 68. Notice that n has two
groups of two digits: 65 and 68. Another example: the decoding of
65666768 is ABCD, since n is composed of 65, 66, 67, and 68.

It is necessary to implement the recursive function
void decodificacio(int) with the following specification:

PRE:  The input is an integer n such that:

1.  n ≥ 65

2.  n = d₁d₂d₃d₄…d_(m − 1)d_(m).

3.  m is even

4.  for any pair of digits d_(i)d_(i + 1) (i odd) we have that
    65 ≤ d_(i)d_(i + 1) ≤ 90.

POST: writes the decoding of n to the output channel cout.

Observation

Only recursive solutions are accepted.

IMPORTANT: You only need to submit the requested function, and possibly
other necessary actions and functions. However, you must keep the type
definitions and #includes.

Input

The input consists of a natural number n ≥ 65 such that
n = d₁d₂d₃d₄…d_(m − 1)d_(m) m is even and for any pair of digits
d_(i)d_(i + 1) such that i is odd, we have that
65 ≤ d_(i)d_(i + 1) ≤ 90.

Output

For each integer n, its decoding.

Problem information

Author: PRO1

Generation: 2026-01-25T13:11:56.575Z

© Jutge.org, 2006–2026.
https://jutge.org
