Programming contests

ECN selejtező programozó csapatverseny, 2016. március 23.

March 23, 2016 10:10 AM – March 23, 2016 3:10 PM


Soundex coding groups together words that appear to sound alike based on their spelling. For example, “can” and “khawn”, “con” and “gone” would be equivalent under Soundex coding.

Soundex coding involves translating each word into a series of digits, in which each digit represents a letter:

  • 1 represents B, F, P, or V.
  • 2 represents C, G, J, K, Q, S, X, or Z.
  • 3 represents D or T.
  • 4 represents L.
  • 5 represents M or N.
  • 6 represents R.

The letters A, E, I, O, U, H, W, and Y are not represented in Soundex coding, and repeated letters with the same code digit are represented by a single instance of that digit. Words with the same Soundex coding are considered equivalent.

Input Specification

Each line of the input contains a single word, all uppercase, less than 20 letters long.

Output Specification

For each line of input, produce a line of output giving the Soundex code. If there are no codable letters in the input word, output a blank line.

Sample Input

  1. KHAWN
  3. BOBBY
download as text file

Output for Sample Input

  1. 25
  2. 1236
  3. 11
download as text file
University of Debrecen; Faculty of Informatics; v. 03/01/2019