CCC '15 J3 - Rövarspråket

View as PDF

Submit solution

Points: 5
Time limit: 2.0s
Memory limit: 64M

Problem type
Canadian Computing Competition: 2015 Stage 1, Junior #3

In Sweden, there is a simple child's game similar to Pig Latin called Rövarspråket (Robbers Language).

In the CCC version of Rövarspråket, every consonant is replaced by three letters, in the following order:

  • the consonant itself;
  • the vowel closest to the consonant in the alphabet (e.g., if the consonant is d, then the closest vowel is e), with the rule that if the consonant falls exactly between two vowels, then the vowel closer to the start of the alphabet will be chosen (e.g., if the consonant is c, then the closest vowel is a);
  • the next consonant in the alphabet following the original consonant (e.g., if the consonant is d, then the next consonant is f) except if the original consonant is z, in which case the next consonant is z as well.

Vowels in the word remain the same. (Vowels are a, e, i, o, u and all other letters are consonants.) Write a program that translates a word from English into Rövarspråket.

Input Specification

The input consists of one word entirely composed of lowercase letters. There will be at least one letter and no more than 30 letters in this word.

Output Specification

Output the word as it would be translated into Rövarspråket on one line.

Sample Input 1


Output for Sample Input 1


Sample Input 2


Output for Sample Input 2



  • 12
    risperss  commented on Nov. 19, 2020, 2:52 p.m.

    I think it should be mentioned that the nearest vowel does not wrap around the alphabet. 'y' is 2 positions away from 'a' and 4 away from 'u' but it considers 'u' to be closer since it does not have to wrap around to the beginning.