百搭背心★瘋搶↘1206檔好股票放一年賺5成正妹的東京自助旅行買太多也不行!7500...
2012-06-05 16:14:40 人氣(373) | 回應(0) | 推薦(0) | 收藏(0) 上一篇 | 下一篇

[UVA] 10260 - Soundex Time

0
收藏
0
推薦

Problem D: 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.

Sample Input

KHAWN
PFISTER
BOBBY

Output for Sample Input

25
1236
11

#include <stdio.h>

int main() {
char str[50], ch[] = " 123 12 22455 12623 1 2 2";
while(scanf("%s", str) == 1) {
int last = -1, i;
for(i = 0; str[i]; i++) {
if(ch[str[i]-'A'] >= '0') {
if(ch[str[i]-'A'] != last) {
last = ch[str[i]-'A'];
printf("%c", ch[str[i]-'A']);
}
} else
last = -1;
}
puts("");
}
return 0;
}
 

10260Soundex
台長:Morris
人氣(373) | 回應(0)| 推薦 (0)| 收藏 (0)| 轉寄
全站分類: 不分類 | 個人分類: UVA |
此分類下一篇:[UVA][sstream使用] 482 - Permutation Arrays
此分類上一篇:[UVA][priority_queue] 5864 - Register Allocation

我要回應
是 (若未登入"個人新聞台帳號"則看不到回覆唷!)
* 請輸入識別碼:
請輸入以下數字 (ex:123)

(有*為必填)
詳全文