Problem A. Alignment of Code

You are working in a team that writes Incredibly Customizable Programming Codewriter (ICPC) which is basically a text editor with bells and whistles. You are working on a module that takes a piece of code containing some definitions or other tabular information and aligns each column on a fixed vertical position, while keeping the resulting code as short as possible, making sure that only whitespaces that are absolutely required stay in the code. So, that the first words on each line are printed at position p1 = 1; the second words on each line are printed at the minimal possible position p2, such that all first words end at or before position p2 - 2; the third words on each line are printed at the minimal possible position p3, such that all second words end at or before position p3 - 2, etc.

Input

The input contains one or more lines of the code up to the end of file. All lines (including the last one) are terminated by a standard end-of-line sequence. Each line contains at least one word, each word is 1 to 80 characters long (inclusive). Words are separated by one or more spaces. Lines of the code can have both leading and trailing spaces. Each line in the input is at most 180 characters long. There are at most 1000 lines in the input.

Output

Write to the output the reformatted, aligned code that consists of the same number of lines, with the same words in the same order, without trailing and leading spaces, separated by one or more spaces such that the i-th word on each line starts at the same position pi.

The “_” character in the example below denotes a space character in the actual input (ASCII code 32).

Sample Input

__start:__integer;____//_begins_here
stop:_integer;_//__ends_here__
_s:__string;___
c:___char;_//_temp_

Sample Output

start:_integer;_//_begins_here
stop:__integer;_//_ends___here
s:_____string;
c:_____char;____//_temp

All Submissions
Best Solutions


Point Value: 7
Time Limit: 2.00s
Memory Limit: 128M
Added: Jul 26, 2011

Languages Allowed:
C++03, PAS, C, HASK, ASM, RUBY, PYTH2, JAVA, PHP, SCM, CAML, PERL, C#, C++11, PYTH3

Comments (Search)

Why does this problem have the longest time limit on PEG?

It was originally used as a contest program and was never edited. I've set a time limit for this problem specifically.

how do i detect "a standard end-of-line sequence" and know when the input is over? (in C++)

A "standard end-of-line sequence" is just a newline. To know when input is over, read up on eof.