Logo
(追記) (追記ここまで)

4402번 - Soundex 다국어

시간 제한메모리 제한제출정답맞힌 사람정답 비율
1 초 128 MB22912111959.204%

문제

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.

제한

예제 입력 1

KHAWN
PFISTER
BOBBY

예제 출력 1

25
1236
11

힌트

출처

Contest > Waterloo's local Programming Contests > 25 September, 1999 B번

(追記) (追記ここまで)

출처

대학교 대회

  • 사업자 등록 번호: 541-88-00682
  • 대표자명: 최백준
  • 주소: 서울시 서초구 서초대로74길 29 서초파라곤 412호
  • 전화번호: 02-521-0487 (이메일로 연락 주세요)
  • 이메일: contacts@startlink.io
  • 통신판매신고번호: 제 2017-서울서초-2193 호

AltStyle によって変換されたページ (->オリジナル) /