Unix ls 字符串的格式化

Description

The computer company you work for is introducing a brand new computer line and is developing a new Unix-like operating system to be introduced along with the new computer. Your assignment is to write the formatter for the ls function.

Your program will eventually read input from a pipe (although for now your program will read from the input file). Input to your program will consist of a list of (FF) filenames that you will sort (ascending based on the ASCII character values) and format into (CC) columns based on the length (LL) of the longest filename. Filenames will be between 1 and 60 (inclusive) characters in length and will be formatted into left-justified columns. The rightmost column will be the width of the longest filename and all other columns will be the width of the longest filename plus 2. There will be as many columns as will fit in 60 characters. Your program should use as few rows (RR) as possible with rows being filled to capacity from left to right.

Input

The input file will contain an indefinite number of lists of filenames. Each list will begin with a line containing a single integer ( 1≤N≤1001≤N≤100). There will then be NN lines each containing one left-justified filename and the entire line's contents (between 1 and 60 characters) are considered to be part of the filename. Allowable characters are alphanumeric (a to z, A to Z, and 0 to 9) and from the following set { ._- } (not including the curly braces). There will be no illegal characters in any of the filenames and no line will be completely empty.

Immediately following the last filename will be the NN for the next set or the end of file. You should read and format all sets in the input file.

Output

For each set of filenames you should print a line of exactly 60 dashes (-) followed by the formatted columns of filenames. The sorted filenames 1 to RR will be listed down column 1; filenames R+1R+1 to 2R2R listed down column 2; etc.

Samples

Input 

10
tiny
2short4me
very_long_file_name
shorter
size-1
size2
size3
much_longer_name
12345678.123
mid_size_name
12
Weaser
Alfalfa
Stimey
Buckwheat
Porky
Joe
Darla
Cotton
Butch
Froggy
Mrs_Crabapple
P.D.
19
Mr._French
Jody
Buffy
Sissy
Keith
Danny
Lori
Chris
Shirley
Marsha
Jan
Cindy
Carol
Mike
Greg
Peter
Bobby
Alice
Ruben

Output

------------------------------------------------------------
12345678.123         size-1               
2short4me            size2                
mid_size_name        size3                
much_longer_name     tiny                 
shorter              very_long_file_name  
------------------------------------------------------------
Alfalfa        Cotton         Joe            Porky          
Buckwheat      Darla          Mrs_Crabapple  Stimey         
Butch          Froggy         P.D.           Weaser         
------------------------------------------------------------
Alice       Chris       Jan         Marsha      Ruben       
Bobby       Cindy       Jody        Mike        Shirley     
Buffy       Danny       Keith       Mr._French  Sissy       
Carol       Greg        Lori        Peter

Source

ACM South Central USA 1995， UVA 400

题意：

把一些字符串按ASCII值排序后，用尽可能少的行打印出来，但一行长度不能超过60。这些字符串中最大长度为max,最后一列每个字符串需占max，其他的列每个字符串需占max+2。

详见代码：

#include<bits/stdc++.h>
using namespace std;
int main()
{
	int t,i;
	while(cin>>t)
	{
		int p=t,j=1;
		int maxx=-1;
		string ans[200];
		while(p--)
		{
			string s;
			cin>>s;
			ans[j++]=s;
			int n=s.size();
			maxx=max(maxx,n);//统计最长的长度 
		}
		sort(ans+1,ans+t+1); 
		for(int i=0;i<60;i++)cout<<'-';  cout<<'\n';//打印虚线 
		
		int k;
		for(i=t;i>=1;i--)//找到符合条件的最大列数使得行数最少 ，i代表列 
		{
			if(maxx+(maxx+2)*(i-1)<=60)break;
		}
		if(t%i==0)k=t/i;else k=t/i+1;//共有k行 
		int c=i;//共有c列 
		if(c==1)
		{
			for(i=1;i<=t;i++)
			{
				cout<<ans[i];
				int m=maxx-ans[i].size();
				if(m!=0)
				{
					for(int y=0;y<m;y++)cout<<' ';// 打印空格使得格式符合 
				}
				cout<<'\n';
			}
		}
		else 
		{
			int q=k*c-t;// q方便比较某字符串是否是最后一列 
			for(int x=1;x<=k;x++)//x是每一行的开头元素 
			for(i=x;i<=x+(c-1)*k;i=i+k)//一行一行的输出 
			{
				if(i<=t)//避免例三那样有超范围使得空缺的情况 
				{
					if(i>=t-(k-q)+1)
					{
						cout<<ans[i];
						int m=maxx-ans[i].size();
				       if(m!=0)
				       {
					    for(int y=0;y<m;y++)cout<<' ';// 打印空格使得格式符合 
				       }
				       cout<<'\n';
					}
					else
					{
						cout<<ans[i];
					int m=maxx-ans[i].size();
				    
					for(int y=0;y<m+2;y++)cout<<' ';//不同的就是m+2; 
					}
				}
				else cout<<'\n';//若像例三最后一列有超范围的直接换行 
			}
        }
	}
}