zoj1858

题目大意：

Soundex coding把每一个单词翻译成一系列数字，规则如下：
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
A, E, I, O, U, H, W, and Y不包含在内，有相同编码数字的重复字母只出现一次
请输出编码

解题思路：

无

代码如下：

#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;

int main()
{
  char str[25];
  int num[25];
  int mark[30];
  memset(mark,0,sizeof(mark));
  mark['B'-'A']=mark['F'-'A']=mark['P'-'A']
  =mark['V'-'A']=1;
  mark['C'-'A']=mark['G'-'A']=mark['J'-'A']
  =mark['K'-'A']=mark['Q'-'A']=mark['S'-'A']
  =mark['X'-'A']=mark['Z'-'A']=2;
  mark['D'-'A']=mark['T'-'A']=3;
  mark['L'-'A']=4;
  mark['M'-'A']=mark['N'-'A']=5;
  mark['R'-'A']=6;
  while(scanf("%s",str)!=EOF)
  {
    memset(num,0,sizeof(num));
    int i=1,j=0;
    if(mark[str[0]-'A']!=0)
    {
      num[j++]=mark[str[0]-'A'];
    }
    while(i<strlen(str))
    {
      if(mark[str[i]-'A']==0)
      { 
        i++;
        continue;
      }
      if(mark[str[i]-'A']==mark[str[i-1]-'A'])
      {
        i++;
      }
      else
      {
        num[j++]=mark[str[i]-'A'];i++;
      }
    }
    for(i=0;i<j;i++)
      printf("%d",num[i]);
    printf("\n");
  }
  return 0;
}