UVA 400－Unix Is

题目大意：将n个字符串按字典序排序，按列输出，每行最多输出60个字符，要求行数最少。

解题思路：除了最后一列所占宽度为最长字符串宽度，其他都为最长字符串长度加2，先求出共几行，然后再输出

#include <stdio.h>#include <string.h>#include <iostream>using namespace std;int cmp(const void *a, const void *b) {    return strcmp((char*)a, (char*)b);}int main() {    int n;    while(scanf("%d", &n) != EOF) {        getchar();        char a[10000][1000];        int max = 0;        for(int i = 0; i < n; i++) {            scanf("%s", a[i]);            if(max < strlen(a[i]))                max = strlen(a[i]);        }        qsort(a, n, sizeof(a[0]), cmp);        int l1 = 62 / (max + 2);        int l2 = n / l1;        int l3 = n % l1;        if(l3 != 0)            l2++;        printf("------------------------------------------------------------\n");        for(int i = 0; i < l2; i++) {            int k = l1;            for(int j = i; j < n; j = j + l2) {                printf("%-*s", max, a[j]);                k--;                if(k == 0)                    break;                printf("  ");            }            printf("\n");        }    }    return 0;}