| Online Judge | Online Exercise | Online Teaching | Online Contests | Exercise Author |
|
F.A.Q Hand In Hand Online Acmers |
Best Coder beta VIP | STD Contests DIY | Web-DIY beta |
Soundex Indexing
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 286 Accepted Submission(s): 66
Problem Description
The Soundex Index System was developed so that similar sounding names, or names with similar spelling could be encoded for easy retrieval. It has been used by the U.S. Bureau of the Census, and some States use it to help encode your driver's license number. Your task is to read a sequence of names, one at a time and one per line, compute the corresponding soundex code, and write to the output file the name and its soundex code (one line of output per name).
Names will contain from 1 to 20 upper case, alphabetic characters (ASCII values 65 thru 90, inclusive). Names shorter than 20 characters will NOT be padded with blanks. Thus a narne will consist of upper case letters only.
How to generate the Soundex Code:
A Soundex Code always consists of a letter followed by three digits. Here are the rules for soundex encoding:
1. The first letter of a name appears as the first and only letter in the soundex code.
2. The letters A, E, I, O, U, Y, W, & H are never encoded, but do break successive code sequences (see next rule).
3. All other letters are encoded EXCEPT when they immediately follow a letter (including the first letter) that would be encoded with the same code digit.
4. The soundex code guide is:
5. Trailing zeros are appended to short codes so all names are encoded with a letter followed by three digits.
6. Longer codes are truncated after the third digit.
Names will contain from 1 to 20 upper case, alphabetic characters (ASCII values 65 thru 90, inclusive). Names shorter than 20 characters will NOT be padded with blanks. Thus a narne will consist of upper case letters only.
How to generate the Soundex Code:
A Soundex Code always consists of a letter followed by three digits. Here are the rules for soundex encoding:
1. The first letter of a name appears as the first and only letter in the soundex code.
2. The letters A, E, I, O, U, Y, W, & H are never encoded, but do break successive code sequences (see next rule).
3. All other letters are encoded EXCEPT when they immediately follow a letter (including the first letter) that would be encoded with the same code digit.
4. The soundex code guide is:
5. Trailing zeros are appended to short codes so all names are encoded with a letter followed by three digits.
6. Longer codes are truncated after the third digit.
Input
The input file, SOUNDEX.IN, contains a list of names, one per line. Each name will not exceed 20 characters, and you may assume that only upper case letters will be used. Your program should continue to read names until the end of the file is detected.
Output
The output written to the file SOUNDEX.OUT should consist of a column of names and a column of their corresponding soundex codes. Write the headings "NAME" and "SOUNDEX CODE" in the first line of the output file in columns 10 and 35, respectively. After the heading line, the names and soundex codes should be written (one pair per line) with the name starting in column 10 and the soundex code beginning in column 35. The comment "END OF OUTPUT" should appear at the end of the output file on the line immediately after the last name. This comment should be written starting in column 20.
Sample Input
LEE KUHNE EBELL EBELSON SCHAEFER SCHAAK
Sample Output
[bk][bk][bk][bk][bk][bk][bk][bk][bk]NAME[bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk]SOUNDEX CODE [bk][bk][bk][bk][bk][bk][bk][bk][bk]LEE[bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk]L000 [bk][bk][bk][bk][bk][bk][bk][bk][bk]KUHNE[bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk]K500 [bk][bk][bk][bk][bk][bk][bk][bk][bk]EBELL[bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk]E140 [bk][bk][bk][bk][bk][bk][bk][bk][bk]EBELSON[bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk]E142 [bk][bk][bk][bk][bk][bk][bk][bk][bk]SCHAEFER[bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk]S160 [bk][bk][bk][bk][bk][bk][bk][bk][bk]SCHAAK[bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk]S200 [bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk]END OF OUTPUT [bk][bk][bk][bk][bk][bk][bk][bk][bk]|[bk][bk][bk][bk][bk][bk][bk][bk][bk]|[bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk]| [bk][bk][bk][bk][bk][bk][bk][bk][bk]|[bk][bk][bk][bk][bk][bk][bk][bk][bk]|[bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk][bk]|__ Column 35 [bk][bk][bk][bk][bk][bk][bk][bk][bk]|[bk][bk][bk][bk][bk][bk][bk][bk][bk]|__ Column 20 [bk][bk][bk][bk][bk][bk][bk][bk][bk]|__ Column 10
Source
| Home | Top |
Hangzhou Dianzi University Online Judge 3.0 Copyright © 2005-2024 HDU ACM Team. All Rights Reserved. Designer & Developer : Wang Rongtao LinLe GaoJie GanLu Total 0.000000(s) query 1, Server time : 2024-11-23 01:48:58, Gzip enabled |
Administration |