Morris' Blog 我在摸索我存在的意義、生命的意義、內涵及價值。 沒有真正神手般的厲害，套用模式是大部分的情況。 沒那麼厲害的我存在的意義為何，襯托出神的存在？ 有時候不能怪別人不給我機會，我已經開始省思， 為什麼我沒有給別人機會的原因，而是全要靠別人。 有時候我認為我與眾不同，那是因為我做不到很多人能辦到的事情。 我聽不到、玩不起來、說得不夠明瞭、理解得不夠多， 我缺少的語文能力，就是一切一切無能的判定。 為此，我不曉得能做些對別人有幫助的事情。 我知道我自己是個不服輸的性格，但現在我不得不認輸。 我沒有能力，因此我必須認輸。 我到底來這世界作什麼？處處充滿不確定性， 而我總是無法出類拔萃，想當個一般人似乎也回不了頭了。 越強大的挑戰需要越強力的支持，而我的支持是什麼？ 最近嘗試與人談話，但都是失敗的結局，沒人能接受， 不需要言語，不需要溝通，一切所想都表達不出來。

49愛的鼓勵 6訂閱站台

Problem D
"Dictionary"

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 first line of the input contains an integer indicating the number of test cases in the input. Then there is a blank line and the test cases separated by a blank line. Each test case 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.

Output

For each test case write to the output file 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. Print a blank line between test cases.

Sample input

1

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 for the sample input

NOTE: For reading convenience spaces are replaced with '.' characters. Your output file should contain spaces instead.

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

---

猜懂題目意思真不容易，總之一次最多再縮一格，如果前綴相同的話。

#include <stdio.h>

int main() {
    int t;
    char s[2][100];
    gets(s[0]);
    sscanf(s[0], "%d", &t);
    gets(s[0]);
    while(t--) {
        gets(s[0]);
        puts(s[0]);
        int flag = 1, same = 0, i;
        while(gets(s[flag]) && s[flag][0]) {
            for(i = 0; s[flag][i] && i <= same; i++) {
                if(s[flag][i] != s[1-flag][i])
                    break;
            }
            if(i == same+1)
                same++;
            else
                same = i;
            for(i = 0; i < same; i++)
                putchar(' ');
            puts(s[flag]);
            flag = 1-flag;
        }
        if(t)
            puts("");
    }
    return 0;
}