1 #include <iostream>
2 #include <
string>
3 #include <algorithm>
4 #include <vector>
5 #include <cmath>
6 7 using namespace std;
8 9 vector<
string> words;
10 void print(
const string &s,
int len,
char extra);
11 int main() {
12 13 14 int n;
15 string w;
16 17 while (cin >> n) {
18 19 int max = 0;
20 words.clear();
21 for (
int i = 0; i < n; i++) {
22 cin >> w;
23 string::size_type str_size = w.size();
24 if (str_size > max) max = str_size;
25 words.push_back(w);
26 }
27 int cols = (60 - max) / (max + 2) + 1;
28 int rows = ceil(
double(n) / cols);
29 sort(words.begin(), words.end());
30 print("", 60, ‘-‘);
31 cout << endl;
32 for(
int r = 0; r < rows; r++) {
33 34 for (
int c = 0; c < cols; c++) {
35 36 int idx = c * rows + r;
37 if (idx < n) print(words[idx],(c == cols - 1? max: max + 2), ‘ ‘);
38 39 }
40 41 cout << endl;
42 43 }
44 45 46 }
47 48 return 0;
49 50 }
51 52 void print(
const string &s,
int len,
char extra) {
53 54 cout << s;
55 string::size_type str_size = s.size();
56 for (
int i = 0; i < len - str_size; i++) {
57 cout << extra;
58 }
59 }
