1011.cpp

这是哈尔滨工业大学acmOJ的源代码

/*  This Code is Submitted by wywcgs for Problem 1011 on 2005-11-12 at 17:19:12 */ 
#include <cstdio>
#include <cstring>
#include <cstdlib>

const int MAX = 128;

int cmp(const void*, const void*);

int main()
{
	char word[MAX][MAX];
	int n, p, m;
	int i, j, max, l, k;
	
	while(scanf("%d", &n) == 1) {
		max = 0;
		for(i = 0; i < n; i++) {
			scanf("%s", word[i]);
			l = strlen(word[i]) + 2;
			if(l > max) {
				max = l;
			}
		}
		qsort(word, n, sizeof(word[0]), cmp);
		if(max < 60) {
			p = 60 / max;
		} else {
			p = 1;
		}
		m = (n + p - 1) / p;
		for(i = 0; i < 60; i++) {
			putchar('-');
		}
		putchar('\n');
		for(i = 0; i < m; i++) {
			for(j = 0, l = 0; j < p; j++) {
				if(j * m + i < n) {
					for(k = 0; k < l; k++) {
						putchar(' ');
					}
					l = max - strlen(word[j*m+i]);
					printf("%s", word[j*m+i]);
				}
			}
			putchar('\n');
		}
	}
	
	return 0;
}

int cmp(const void *a, const void *b)
{
	if(strcmp((char*)a, (char*)b) < 0) {
		return -1;
	} else {
		return 1;
	}
}