POJ 1750 Dictionary(模拟)
2014-09-12 00:24
429 查看
题目链接:http://poj.org/problem?id=1750
Description
Authors of the new, all-in-one encyclopedia have organized the titles in the order they consider most appropriate for their readers. It's not always alphabetical, because they want to observe some peculiar relationships between them. However, they still want
to allow users to look up titles quickly.
They achieve this by adding a carefully calculated number of spaces before every title in the list of titles. They call this structure a dictionary.
A dictionary is represented by a list of words with some number of spaces before certain words. Dictionary format can be described as a set of constraints on sequences of consecutive words starting with the same letter. Any maximal sequence of consecutive words
starting with the same letter should satisfy the following rules:
The first word in the group has no spaces before it. Every subsequent word in the group has at least one leading space.
If
the first word of the group is deleted and
one space is deleted before every remaining word and
the first letter is deleted from every remaining word
then resulting sequence is a dictionary.
The authors don't feel like giving you a more detailed explanation of what a dictionary is, so they have included an example (see sample input and output) that clarifies their definition.
Your task is to write a program that will convert a given list of words into a dictionary by adding some number of spaces before certain words and preserving the original order of the words.
Input
The input consists of at least one and most 100000 words. Each word consists of at least one and at most 10 lower-case letters. There will be no leading or trailing spaces. There will be no blank lines between the words, but there may be an arbitrary number
of blank lines at the end of the file.
Output
Write to the output the original words in the same order without any trailing spaces but with the appropriate number of leading spaces, so that this word list is a dictionary. There should be no blank lines between the words, but there may be an arbitrary number
of blank lines at the end of the file.
Sample Input
Sample Output
Source
Northeastern Europe 1999
题意:
比较每个字符串与前面的字符串相同的字符的个数,如果相同的字符的个数比上一字符串与上上一个字符串相同的字符多,那么就让此字符串前面,在上一字符串已有的空格的基础上多增加一个空格,相反如果是小于,那么就按照当前相同的字符打印空格,PS:说得不明不白的,具体见代码就懂了!
代码如下:
Description
Authors of the new, all-in-one encyclopedia have organized the titles in the order they consider most appropriate for their readers. It's not always alphabetical, because they want to observe some peculiar relationships between them. However, they still want
to allow users to look up titles quickly.
They achieve this by adding a carefully calculated number of spaces before every title in the list of titles. They call this structure a dictionary.
A dictionary is represented by a list of words with some number of spaces before certain words. Dictionary format can be described as a set of constraints on sequences of consecutive words starting with the same letter. Any maximal sequence of consecutive words
starting with the same letter should satisfy the following rules:
The first word in the group has no spaces before it. Every subsequent word in the group has at least one leading space.
If
the first word of the group is deleted and
one space is deleted before every remaining word and
the first letter is deleted from every remaining word
then resulting sequence is a dictionary.
The authors don't feel like giving you a more detailed explanation of what a dictionary is, so they have included an example (see sample input and output) that clarifies their definition.
Your task is to write a program that will convert a given list of words into a dictionary by adding some number of spaces before certain words and preserving the original order of the words.
Input
The input consists of at least one and most 100000 words. Each word consists of at least one and at most 10 lower-case letters. There will be no leading or trailing spaces. There will be no blank lines between the words, but there may be an arbitrary number
of blank lines at the end of the file.
Output
Write to the output the original words in the same order without any trailing spaces but with the appropriate number of leading spaces, so that this word list is a dictionary. There should be no blank lines between the words, but there may be an arbitrary number
of blank lines at the end of the file.
Sample Input
a ant antique amaze bargain bridge bride bribe born bucket tart tan tram trolley t try trial zed double dorm do dormant donate again agony boost back born
Sample Output
a ant antique amaze bargain bridge bride bribe born bucket tart tan tram trolley t try trial zed double dorm do dormant donate again agony boost back born
Source
Northeastern Europe 1999
题意:
比较每个字符串与前面的字符串相同的字符的个数,如果相同的字符的个数比上一字符串与上上一个字符串相同的字符多,那么就让此字符串前面,在上一字符串已有的空格的基础上多增加一个空格,相反如果是小于,那么就按照当前相同的字符打印空格,PS:说得不明不白的,具体见代码就懂了!
代码如下:
#include <cstdio> #include <cstring> int main() { char s1[17], s2[17]; int tt=0; while(gets(s2)) { int i=0,j=0; int len1 = strlen(s1); int len2 = strlen(s2); while(i<len1 && j<len2) { if(s1[i] == s2[j]) { i++; j++; } else break; } if(i <= tt) tt = i; if(i > tt) tt += 1; strcpy(s1,s2); for(int i = 0; i < tt; i++) printf(" "); printf("%s\n",s2); } return 0; }
相关文章推荐
- poj 1750 Dictionary 模拟
- POJ 1750 Dictionary
- POJ 1750 Dictionary (字符串处理)
- poj 1750 Dictionary(水题:字符串)
- POJ 1750 Dictionary(水~)
- poj1068 Parencodings 模拟 栈
- poj 1068 Parencodings(模拟)
- POJ-模拟-1208 The Blocks Problem
- 假期训练——THE DRUNK JAILER POJ - 1218 模拟
- poj 1835 宇航员(模拟)
- poj 1702 模拟
- POJ-1363(模拟出栈)
- 贪心/模拟 POJ-1017 Packets
- poj 1068 Parencodings(模拟)
- poj 1068 Parencodings(模拟)
- POJ 1027:The Same Game 较(chao)为(ji)复(ma)杂(fan)的模拟
- POJ 1941 The Sierpinski Fractal ——模拟
- POJ 1105 S-Trees (模拟)
- POJ-2260 Error Correction 模拟
- poj 1068 Parencodings 模拟