UVA - 400 Unix ls
题目大意:给定n和n个字符串,对n个字符串按字典序从小到大排序,按列优先顺序并以左对齐的方式输出,每个单词场宽为最长串长度+2,并且每行不超过60字符长度。
解题思路: 直接用qsort排序,然后控制一下输出就可以了
#include <cstdio>
#include <cstring>
#include <algorithm>
int cmp(const void* _a,const void* _b) {
char* a= (char*)_a;
char* b= (char*)_b;
return strcmp(a,b);
}
int main() {
int N;
char a[10000][100];
int flag;
int t;
while (scanf("%d", &N) != EOF) {
int s = 0;
memset (a, 0, sizeof(a));
for (int i = 0; i < N; i++) {
scanf("%s", a[i]);
if (strlen(a[i]) > s)
s = strlen(a[i]);
}
qsort(a, N, 100, cmp);
for (int i = 0; i < 60; i++) printf("-");
printf("\n");
int ss = 62/(s+2);
int r = N / ss;
if ( N % ss) r++;
for (int i = 0; i < r; i++) {
t = 0;
for (int j = i; j < N; j += r) {
printf("%s", a[j]);
t++;
for (int k = strlen(a[j]); k < s; k++)
printf(" ");
if ( t != ss) printf(" ");
}
printf("\n");
}
}
}