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 _p_1 = 1; the second words on each line are printed at the minimal possible position _p_2, such that all first words end at or before position _p_2−2; the third words on each line are printed at the minimal possible position _p_3, such that all second words end at or before position _p_3− 2, etc.

  For the purpose of this problem, the code consists of multiple lines. Each line consists of one or more words separated by spaces. Each word can contain uppercase and lowercase Latin letters, all ASCII punctuation marks, separators, and other non-whitespace ASCII characters (ASCII codes 33 to 126 inclusive). Whitespace consists of space characters (ASCII code 32).

  The input file 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 in the file. 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 file is at most 180 characters long. There are at most 1000 lines in the input file.

  Write to the output file 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 i-th word on each line starts at the same position pi.

Note for the Sample:

  The ‘⊔’ character in the example below denotes a space character in the actual files (ASCII code 32).

␣␣start:␣␣integer;␣␣␣␣//␣begins␣here
stop:␣integer;␣//␣␣ends␣here
␣s:␣␣string;
c:␣␣␣char;␣//␣temp


start:␣integer;␣//␣begins␣here
stop:␣␣integer;␣//␣ends␣␣␣here
s:␣␣␣␣␣string;
c:␣␣␣␣␣char;␣␣␣␣//␣temp

题目的解决思路很清晰，就是录入和输出。录入的方式采用的是读取整行然后赋给stringstream对单词进行分段。分段的该过程中要对每一列的最大长度进行计算。输出就按照正常输出就行，然后后面计算空格的个数。

注意：每一行最后一个单词后面直接换行，不要输出空格！！！

#include<iostream>
#include<vector>
#include<cstring>
#include <algorithm>
#include<queue>
#include<sstream>
using namespace std;
int main()
{
    queue<string>str[1010];
    int maxlen[200] = { 0 };
    char arr[200] = { 0 };
    memset(arr, ' ', 200);
    int num = 0;
    string s;
    char ss[200];
    while (cin.getline(ss,200))
    {
        int i = 0;
        stringstream sss(ss);
        while (sss >> s)
        {
            str[num].push(s);
            if (s.length() > maxlen[i++])maxlen[i-1] = s.length();
        }
        num++;
    }
    for (int i = 0;i < num;i++)
    {
        int j = 0;
        while (!str[i].empty())
        {
            cout << str[i].front();
            if (str[i].size() != 1)
            {
                arr[maxlen[j] - str[i].front().length()] = '\0';
                cout << arr;
                arr[maxlen[j++] - str[i].front().length()] = ' ';
            }
            str[i].pop();
            if (str[i].size())cout << " ";
            else {
                cout << endl;break;
            }
        }
    }
}