Shortest Prefixes
Shortest Prefixes
Input: Prefix .in
Output: Prefix .out
A prefix of a string is a substring string at the beginning of the given string. The prefixes of "carbon" are: "c", "ca", car", "carb", "carbo", and "carbon". Note that the empty string is not considered a prefix in this problem, but every non-empty string is considered to be a prefix of itself. In everyday language, we tend to abbreviate words by prefixes. For example, "carbohydrate "is commonly abbreviated by "carb". In this problem, given a set of words, you will find for each word the shortest prefix that uniquely identifies the word it represents.
In the sample input below, "carbohydrate" can be abbreviated to "carboh", but it cannot be abbreviated to "carbo" (or anything shorter) because there are other words in the list that begin with "carbo".
An exact match will override a prefix match. For example, the prefix "car" matches the given word "car" exactly. Therefore, it is understood without ambiguity that "car" is an abbreviation for "car", not for "carriage" or any of the other words in the list that begins with "car"
"" Input ""
The input file contains at least two, but no more than 1000 lines. Each line contains one word consisting of 1 to 20 lower case letters.
"" Output ""
The output file contains the same number of lines as the input file. Each line of the output file contains the word from the corresponding line of the input file, followed by one blank space; and the shortest prefix that uniquely (without ambiguity) identifies this word.
"" Sample input ""
carbohydrate
cart
carburetor
caramel
caribou
carbonic
cartilage
carbon
carriage
carton
car
carbonate
"" Output for sample input ""
carbohydrate carboh
cart cart
carburetor carbu
caramel cara
caribou cari
carbonic carboni
cartilage carti
carbon carbon
carriage carr
carton carto
car car
carbonate carbona
- Plain text response
- Attached file(s):
- BrainMass_29679.htm
- BrainMass_29679.vsd
- BrainMass_Algo_29679.txt
- Your Information is Secure
- Best Online Academic Help Service
- Students find real academic Success
- For a B-tree of order 4 consisting of 3 levels, what is the maximum amount of records which may be stored? - Please answer the following questions as detailed as possible: 1. For a B-tree of order 4 consisting of 3 levels, what is the maximum amount of records which may be stored? 2. For a B+-tree of ...
- Visual Basic - Input file containing info for 50 states Create a class state with 5 properties to hold the information about a single state and a method that calculates the density(people per square mile) of a st ...
- Java code - I require support in remarking the enclosed Java Code high-lighting, things like code layout, use of variable names, general readability and understandability.
- Java Code Example - I need assistance in commenting on the enclosed code, consider things like code layout, use of variable names, general readability and understandability. The enclosed program implements a class ca ...
- Programming Problem (Selection) - Given: To locate the nearest numbered cross street for a given avenue address, the following algorithm can be used: cancel the last diget of the address, divide by 2, and add or subtract the number gi ...
