UVA 400 Unix Is

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 (  ). 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

题意：

输入正整数n以其n个文件名，排序后按列优先的方式左对齐输出。而且每行的最右列是 M字符（最长文件名字符数），其余列为 M+2 字符。

思路：

重点是确定输出的行和列，如何实现如此输出。

代码：

#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <string>

using namespace std;

const int maxcol=60;
const int maxn=105;

void print(const string &s,int len,char c)
{
    cout<<s;
    for(int i=0;i<len-(int)s.length();i++)
        cout<<c;
}

int main()
{
    string s[maxn];
    int n;
    while(cin>>n)
    {
        int M=0;
        for(int i=0;i<n;i++)
        {
            cin>>s[i];
            M=max(M,(int)s[i].length());
        }
        sort(s,s+n);
        print("",maxcol,'-');
        cout<<endl;

        int cols=(maxcol-M)/(M+2)+1,//算列数，最后列是M字符，其他列是M+2字符
            rows=(n-1)/cols+1;//算行数，向上取整

        for(int i=0;i<rows;i++)
        {
            for(int j=0;j<cols;j++)
            {
                int t=rows*j+i;//巧妙地控制输出，虽是横向输出，确是实现了优先按列输出
                if(t<n)
                    print(s[t],i==cols-1?M:M+2,' ');
            }
            cout<<endl;
        }
    }
    return 0;
}