1941Soundex

1941   Soundex

题目描述

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.

输入格式:

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

输出格式:

For each line of input, produce a line of output giving the Soundex code.

输入样例 复制
KHAWN
PFISTER
BOBBY
输出样例 复制
25
1236
11

说明

39
118
通过提交
时空限制2000ms/64mb
题目来源University of Waterloo Local Contest 1999.09.25
评测方式在线评测
题目类型
难        度