UVA 400 Unix ls

题目

分析

代码

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

int cmp(const void* a, const void* b)
{
return strcmp((char*)a, (char*)b);
}

int main(void) {
char name[105][65];
int n, i, j, k, max_len, c, w, t;
while (scanf("%d", &n) != EOF) {
max_len = 0;
for (i = 0; i < n; i++) {
scanf("%s", &name[i]);
max_len = max_len < strlen(name[i])? strlen(name[i]): max_len;
}
c = (60 - max_len) / (max_len + 2) + 1;
w = (n - 1) / c + 1;
qsort(name, n, sizeof(name[0]), cmp);
printf("------------------------------------------------------------\n");
for (i = 0; i < w; i++) {
for (j = 0; j < c; j++) {
if (j*w+i < n) {
printf("%s", name[j*w+i]);
if (j != c-1) t = max_len + 1;
else t = max_len - 1;
for (k = strlen(name[j*w+i])-1; k < t; k++) printf(" ");
}
}
printf("\n");
}
}
return 0;
}