UVa 400 Unix Is

#include<iostream>
#include<cstdio>
#include<string>
#include<map>
#include<algorithm>
#include<vector>
#include<queue>
#include<set>
#include<cstring>
#include<stack>
using namespace std;

int N;

void print(string &s,int len)
{
	cout<<s;
	while(len>s.length())
	{
		cout<<" ";
		len--;
	}
}

int main()
{
	while(scanf("%d",&N)!=EOF)
	{
		string *arr=new string[N];
		int i,j,M=0;
		for(i=0;i<60;i++)
			cout<<"-";
		cout<<endl;
		for(i=0;i<N;i++)
		{
			cin>>arr[i];
			if(arr[i].length()>M)
				M=arr[i].length();
		}
		sort(arr,arr+N);
		int col,row;
		col=(60-M)/(M+2)+1;
		row=(N-1)/col+1;
		for(i=0;i<row;i++)
		{
			for(j=0;j<col;j++)
			{
				int index=j*row+i;
				if(index>=N)
					break;
				print(arr[index],j==col-1?M:M+2);
			}
			cout<<endl;
		}
	}
	return 0;
}