VJ--Unixls命令（Unix ls，UVa400）题解

题意：

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 (F) filenames that you will sort (ascending based on the ASCII character values) and format into (C) columns based on the length (L) 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 (R) 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 ≤ 100). There will then be N 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 N 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 R will be listed down column 1; filenames R + 1 to 2R listed down column 2; etc.

Sample 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

Sample 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

*注：Output样例在这里为了直观，空格并不严格按题意进行

题意分析：

首先题目没有明确的要求程序结束的语句，所以可以用：

while(cin>>T)
{
    your code……
}

首先输入一个int型整数T，接下来T行每行输入不多于60个字符的字符串

对输入的字符串进行按顺序排序，排序后左对齐输出。假设最长文件名有M个字符，则最右列有M个字符，其他列都是M＋2个字符，不够的则在末尾补空格字符。要求输出的每行行数最小。

求行列的数的算法（这个算这道题的核心），参考自：日沉云起

求列数：

求行数：

C++代码：

对代码中可能有疑惑的点：

vector型数据的复制：（vector拷贝有好几种方式：可参考： 徐大大平凡之路）

temp.assign(str.begin(), str.end());//将str的内容copy到temp里面

#include<iostream>
#include<vector>
#include<algorithm>
#define MAX 100

using namespace std;

vector<string> str,temp;

bool cmp(string a,string b)
{
	return a.size()<b.size();
}

int get_maxsize()//取每个测试样例中字符串最长的个数
{
	int max;
	sort(temp.begin(),temp.end(),cmp);
	max = temp.back().size();
	return max;
}

int main()
{
	int T;
	while(cin>>T)
	{
		string ss;
		str.clear();
		for(int i=0;i<T;i++)
		{
			cin>>ss;
			str.push_back(ss);
		}
		sort(str.begin(),str.end());
		temp.assign(str.begin(), str.end());
		int M = get_maxsize();//字符数 
		temp.clear();
		int C = (60-M)/(M+2)+1;//列数 
		int R = T/C;//行数 
		if(T%C!=0)
		{
			R += 1; 
		}
		for(int i=0;i<60;i++)
		{
			cout<<"-";
		}
		cout<<endl;
		for(int i=0;i<R;i++)
		{
			int se = i;
			for(int j=0;j<C;j++)
			{
				if(j!=0)
				{
					se += R;
				}
				if(se>=T) break;
				cout<<str[se];
				for(int k=0;k<M+2-str[se].size();k++)
				{
					cout<<" ";
				} 
			}
			cout<<endl; 
		}
	 } 
	return 0;
 }