UVa 400, Unix ls

添加了以下判定语句，来判断是否是当前行的最右一列。

index + rows >= n ? M : M + 2

#include <iostream>
#include <cmath>
#include <ctime>
#include <climits>
#include <iomanip>
#include <cstring>
#include <sstream>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <iterator>
#include <queue>
using namespace std;
const int MAXN = 100 + 10;
string words[MAXN];

void print(string s, int w, char fill)
{
    cout << s;
    for (int i = 0; i < w - s.length(); i++)
        cout << fill;
}

int main()
{
#ifndef ONLINE_JUDGE
    freopen("sample.in", "r", stdin);
    freopen("test.out", "w", stdout);
#endif
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n;
    while (cin >> n)
    {
        print("", 60, '-');
        cout << endl;
        int M = 0;
        for (int i = 0; i < n; i++)
        {
            cin >> words[i];
            M = max(M, (int)words[i].length());
        }
        sort(words, words + n);
        int cols = (60 - M) / (M + 2) + 1;
        int rows = (n - 1) / cols + 1;
        for (int i = 0; i < rows; i++)
        {
            for (int j = 0; j < cols; j++)
            {
                int index = j * rows + i;
                if (index < n)
                    print(words[index], j == cols - 1 || index + rows >= n ? M : M + 2, ' ');
            }
            cout << endl;
        }
    }
    //end of program
    return 0;
}