题目链接:Unix ls UVA - 400
题目:输入n以及n个文件名,排序后按列优先的方式左对齐输出,假设最长的文件名长度为M,则最右列宽为M,其他为M+2.
思路:计算出M,并计算出行数,然后逐行逐列输出。
代码奉上
#include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<queue>
#include<stack>
#include<map>
#include<vector>
#include<iomanip>
#define ll long long
using namespace std;
const int maxclo = 60;
const int maxn = 30;
string s[110];
int n;
void print(const string &c, int len, char extra) {
cout << c;
for(int i = 0; i < len - c.length(); i++) cout << extra;
}
int main()
{
while(scanf("%d",&n)!=EOF) {
int M = 0;
for(int i = 0; i < n; i++) {
cin >> s[i];
M = max(M, (int)s[i].length());
}
int cols = (maxclo - M) / (M + 2) + 1, rows = (n - 1) / cols + 1;
print("",60,'-'); cout << endl;
sort(s,s+n);
for(int r = 0; r < rows; r++) {
for(int c = 0; c < cols; c++) {
int idx = c * rows + r;
if(idx < n) print(s[idx], c == cols - 1 ? M : M + 2, ' ');
}
cout << endl;
}
}
return 0;
}