Uva 400.Unix is

 1 #include <cstdio>
 2 #include <string>
 3 #include <cstring>
 4 #include <iostream>
 5 #include <vector>
 6 #include <algorithm>
 7 using namespace std;
 8 
 9 class LOVE{
10     private:
11         static const int len=65;
12         static const int maxn=105;
13 
14     public:
15         bool Do(){
16             int n,Max=0;
17             if(!(cin>>n))
18                 return false;
19             cout<<"------------------------------------------------------------\n";
20             string str[maxn];
21             for(int i=0;i<n;i++){
22                 cin>>str[i];
23                 Max=max(Max,(int)str[i].size());
24             }
25             sort(str,str+n);
26 
27             int L,H;
28             for(int i=n;i>0;i--){
29                 L=i;
30                 H=n/L+(n%L?1:0);
31                 int size=Max*L+2*(L-1);
32                 if(size<=60)break;
33             }
34             //cout<<"\n"<<L<<" "<<H<<"\n";
35             for(int i=0;i<H;i++){
36                 for(int j=0;j<L;j++){
37                     cout<<str[i+j*H];
38                     for(int k=0;k<(j==L-1?0:2)+Max-(int)str[i+j*H].size();k++)
39                         cout<<" ";
40                 }
41                 cout<<"\n";
42             }
43             return true;
44         }
45 };
46 
47 int main(){
48     //freopen("in.txt","r",stdin);
49     std::ios::sync_with_stdio(false);
50     LOVE LIVE;
51     while(LIVE.Do());
52     return 0;
53 }