POJ2001——Shortest Prefixes
来源:互联网 发布:联想网络唤醒bios设置 编辑:程序博客网 时间:2024/05/16 08:24
Description
A prefix of a string is a substring starting 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".
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 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 contains the same number of lines as the input. Each line of the output contains the word from the corresponding line of the input, followed by one blank space, and the shortest prefix that uniquely (without ambiguity) identifies this word.
Sample Input
carbohydratecartcarburetorcaramelcariboucarboniccartilagecarboncarriagecartoncarcarbonate
Sample Output
carbohydrate carbohcart cartcarburetor carbucaramel caracaribou caricarbonic carbonicartilage carticarbon carboncarriage carrcarton cartocar carcarbonate carbona
Source
Rocky Mountain 2004
很简单的一题,字典树搞定
很简单的一题,字典树搞定
#include<cstdio>#include<cstring>#include<iostream>#include<algorithm>using namespace std;struct node{node *next[28];int num;node():num(0){memset(next,0,sizeof(next));}};node *root;char book[1010][22];void insert(char *s){int pos;node *p=root;node *q;int len=strlen(s);for(int i=0;i<len;i++){pos=s[i]-'a';if(p->next[pos]==0){q=new node;p->next[pos]=q;p=q;p->num++;}else{p=p->next[pos];p->num++;}}}void find_output(char *s){int len=strlen(s);node *p=root;int pos;char str[22];int k=0;for(int i=0;i<len;i++){pos=s[i]-'a';p=p->next[pos];str[k++]=s[i];str[k]='\0';if(p->num==1){printf("%s\n",str);return ;}}printf("%s\n",s);}int main(){while(~scanf("%s",book[0])){int k=1;root=new node;insert(book[0]);while(scanf("%s",book[k])==1){insert(book[k]);k++;}for(int i=0;i<k;i++){printf("%s ",book[i]);find_output(book[i]);}}return 0;}
0 0
- POJ2001——Shortest Prefixes
- POJ2001——Shortest Prefixes(Trie树模板)
- POJ2001 Shortest Prefixes
- poj2001 Shortest Prefixes
- 【poj2001】Shortest Prefixes
- POJ2001--Shortest Prefixes
- poj2001 Shortest Prefixes
- poj2001 Shortest Prefixes
- POJ2001 Shortest Prefixes
- poj2001 Shortest Prefixes
- 【POJ2001】Shortest Prefixes
- POJ2001[Shortest Prefixes]--Trie
- POJ2001-Shortest Prefixes
- POJ2001 - Shortest Prefixes - 字典树
- POJ2001 Shortest Prefixes【字典树】
- 【poj2001】Shortest Prefixes 字典树
- POJ2001 Shortest Prefixes(字典树)
- poj2001 Shortest Prefixes (trie树)
- NYOJ 221 Tree
- 我做的功能
- HDU 4183 Pahom on Water
- 哪个对象才是锁?
- [递归与分治]棋盘覆盖问题
- POJ2001——Shortest Prefixes
- 华为机试练习---进制数的相互转换
- Dedecms文件目录结构解说
- HDU 4240 Route Redundancy
- 关于WinForm的单例模式
- Android中的apk签名
- wbox和FusionCharts
- swift学习日志-1基础篇 常量变量 布尔值 元组
- 关于bom,以及和bom有关的PHP验证码出不来的问题