#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
string filenames[105];
void print(string s,int len)
{
cout<<s;
for(int i=0;i<len;i++)
cout<<' ';
}
int main()
{
int n;
while(cin>>n)
{
int maxlen=0;
for(int i=0;i<n;i++)
{
cin>>filenames[i];
maxlen=max(maxlen,(int)filenames[i].size());
}
int cols=(60-maxlen)/(maxlen+2)+1,rows=(n-1)/cols+1;
sort(filenames,filenames+n);
for(int i=0;i<60;i++)cout<<'-';cout<<endl;
for(int r=0;r<rows;r++)
{
for(int c=0;c<cols;c++)
{
int id=c*rows+r;
if(id<n)
print(filenames[id],c==(cols-1)?(maxlen-filenames[id].size()):(maxlen+2-filenames[id].size()));
}
cout<<endl;
}
}
}
UVA-400
最新推荐文章于 2021-08-23 10:32:32 发布