uva 400 unix ls（字符数据处理）

题意是将输入的字符串按列优先整理并输出。

刘大神代码：

#include <iostream>
#include <algorithm>
#include <string>
#include <stdio.h>

using namespace std;

const int maxcol = 60;
const int maxn = 100 + 5;

string filenames[maxn];

//输出字符串s，长度不足len时补字符extra
void print(const string& s, int len, char extra)
{
    cout << s;
    for (int i = 0; i < len - s.length(); i++)
        cout << extra;
}

int main()
{
    #ifdef LOCAL
    freopen("in.txt", "r", stdin);
    #endif // LOCAL
    int n;
    while (cin >> n)
    {
        int M = 0;
        for (int i = 0; i < n; i++)
        {
            cin >> filenames[i];
            M = max(M, (int)filenames[i].length());
        }
        //计算行数rows和列数cols
        int cols = (maxcol - M) / (M + 2) + 1;
        int rows = (n - 1) / cols + 1;
        print("", 60, '-');
        cout << endl;
        sort(filenames, filenames + n);
        for (int r = 0; r < rows; r++)
        {
            for (int c = 0; c < cols; c++)
            {
                int idx = c * rows + r;
                if (idx < n)
                    print(filenames[idx], c == cols - 1 ? M : M + 2, ' ');
            }
            cout << endl;
        }
    }
    return 0;
}