UVA 400 (暑假-排序、检索（2）-F- Unix ls)

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
int cmp(const void *a,const void *b)
{
	return strcmp((char *)a,(char *)b);
}
int main()
{
	int i,j,k,max_len,n;
	int h_num,l_num,num_len;
	char str[110][100];
	while(scanf("%d",&n)!=EOF)
	{
		max_len=0;
		for(i=0;i<n;i++)
		{
			scanf("%s",str[i]);
			if(strlen(str[i])>max_len)
				max_len=strlen(str[i]);
		}
		qsort(str,n,100*sizeof(char),cmp);
		printf("------------------------------------------------------------\n");
		h_num=62/(max_len+2);
		l_num=(n-1)/h_num+1;
		int	count = h_num * l_num - n;
		
		for(i=0;i<l_num;i++)
		{
			for(j=0;j<h_num;j++)
			{
				if(j*l_num+i>=n)
					break;
				printf("%s",str[j*l_num+i]);
				num_len=max_len-strlen(str[j*l_num+i]);
				if (count && j == h_num - 2)
					if ( i >= l_num - count )
						continue;
				if (j == h_num - 1)
					break;

				for(k=0;k<num_len;k++)
				{
					printf(" ");
				}
				if(j!=h_num-1)
					printf("  ");
			}
			printf("\n");
		}
	}
	return 0;
}