题目有个固定的数字60,首先根据这个算出行列的个数,然后就可以模拟输出的格式了
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define mk make_pair
#define sz(x) ((int) (x).size())
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pa;
int main() {
int n;
while (cin >> n) {
for (int i = 0; i < 60; i++) cout << "-";
cout << endl;
string s[105];
int len = 0;
for (int i = 0; i < n; i++) {
cin >> s[i];
len = max(len, sz(s[i]));
}
int x = 60 - len;
int r, c;
c = x / (len + 2) + 1;
if (n % c) r = n / c + 1;
else r = n / c;
sort(s, s + n);
int cnt = 0;
vector<string> v[1005];
for (int i = 0; i < c; i++) {
for (int j = 0; j < r; j++) {
v[j].pb(s[cnt++]);
}
}
for (int i = 0; i < r; i++) {
for (int j = 0; j < sz(v[i]); j++) {
cout << v[i][j];
if (j < sz(v[i]) - 1) {
for (int k = 0; k < len + 2 - sz(v[i][j]); k++) cout << " ";
}
}
cout << endl;
}
}
return 0;
}