紫书UVa1593

#include <vector>
#include <map>
#include <sstream>
#include <string>
#include<iostream>
#include<cstdio>
#include <algorithm>
#include<iomanip>
#include<algorithm>
#include<cmath>
#include<set>
#include<stack>
#include<queue>
#include<cstring>
using namespace std;
int main()
{
	//freopen("input.txt", "r", stdin);
	string line;
	vector<vector<string>>code;
	int num = 0;
	int colmax = 0;
	while (getline(cin,line))
	{
		int col = 0;
		stringstream ss;
		code.push_back(vector<string>());
		string word;
		ss << line;
		while (ss >> word)
		{
			++col;
			code[num].push_back(word);
		}
		if (col > colmax)
			colmax = col;
		++num;
	}
	for (int i = 0; i < colmax-1; ++i)
	{
		int maxsize = 0;
		for (int j = 0; j < code.size(); ++j)
		{
			if (i < code[j].size())
			{
				if (code[j][i].size() > maxsize)
					maxsize = code[j][i].size();
			}
		}
		for (int j = 0; j < code.size(); ++j)
		{
			if (i < code[j].size())
			{
				int tosize = maxsize - code[j][i].size() + 1;
				for (int k = 1; k <= tosize ; ++k)
				{
					code[j][i] += ' ';
				}
			}
		}
	}
	for (int i = 0; i < code.size(); ++i)
	{
		for (int j = 0; j < code[i].size(); ++j)
		{
			cout << code[i][j];
		}
		cout << endl;
	}
}