#include<cstdio>
#include<iostream>
#include<string>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn=110;
string arr[maxn];
void print(string s,int len,char ch){
cout<<s;
for(int i=0;i<len-s.length();i++)
cout<<ch;
}
int main(){
int n;
//freopen("123.txt","w",stdout);
while(scanf("%d",&n)==1){
int max_len=0;
for(int i=0;i<n;i++){
cin>>arr[i];
max_len=max(max_len,(int)arr[i].length());//大小还要记得类型转换
}
int cols=(60-max_len)/(max_len+2)+1,rows=(n-1)/cols+1;
print("",60,'-');
cout<<"\n";
sort(arr,arr+n);
for(int r=0;r<rows;r++){
for(int c=0;c<cols;c++){
int id=c*rows+r;//数据结构学的,都忘了,。。。。
if(id<n) print(arr[id],c+1==cols?max_len:max_len+2,' ');
}cout<<"\n";
}
}
}
Unix ls UVA - 400
最新推荐文章于 2020-07-13 17:13:10 发布