UVa 400 - Unix ls

水题，没什么好说的。

#include<iostream>
#include<algorithm>
#include<string>
#define MAXN 105
using namespace std;

void print(string str, int size_l, char ch) {
    cout << str;
    for(int i = (int) str.size(); i < size_l; i++)
        cout << ch;
}

int main() {
    int N;
    while(cin >> N) {
        string word[105];
        int r, c, M = 0;
        for(int i = 0; i < N; i++) {
                cin >> word[i];
                M = max(M, (int)word[i].size());
            }
        c = 1 + (60 - M) / (M + 2);
        r = (N - 1) / c + 1;
        sort(word, word + N);
        for(int i = 0; i < 60; i++)
            cout << "-";
        cout << endl;
        for(int i = 0; i < r; i++) {
            for(int j = 0; j < c; j++)
                if(j * r + i < N) {
                    if(j != c - 1)
                        print(word[j * r + i], M + 2, ' ');
                    else
                        print(word[j * r + i], M, ' ');
            }
            cout << endl;
        }
    }
    return 0;
}

转载于:https://www.cnblogs.com/xuziye0327/p/4249284.html