UVa--400 Unix ls(格式输出)

版权声明:本文为博主原创文章,遵循 CC 4.0 by-sa 版权协议,转载请附上原文出处链接和本声明。

UVa 400


模拟 Unix 的 ls 命令。

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.

设最长文件名的长度为 maxLen,则

#include <bits/stdc++.h>
using namespace std;

const int maxcol = 60;
const int maxn = 100 + 5;
string filenames[maxn];

void print(const string &str, int len, char ch)
    cout << str;
    for(int i = 0; i < len - str.length(); ++i)
        cout << ch;

int main()
    #ifdef LOCAL
    freopen("data.in", "r", stdin);
    #endif // LOCAL
    for(int n; cin >> n; )
        int maxLen = 0;
        for(int i = 0; i < n; ++i){
            cin >> filenames[i];
            maxLen = max(maxLen, (int)filenames[i].length());
        int cols = (maxcol - maxLen) / (maxLen + 2) + 1, rows = (n - 1) / cols + 1; //向上取整
        print("", maxcol, '-');
        cout << endl;

        sort(filenames, filenames + n);
        for(int i = 0; i < rows; ++i)
            for(int j = 0; j < cols; ++j)
                int idx = j * rows + i;
                if(idx < n) print(filenames[idx], j == cols - 1 ? maxLen : maxLen + 1, ' ');
            cout << endl;
    return 0;

Unix ls


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.nYour program will eventually read input from a pipe (although for now your program will read from the input). 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.nnnInputnnThe input 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.nnImmediately 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.nnnOutputnnFor 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.nnnSample Inputnn10ntinyn2short4menvery_long_file_namenshorternsize-1nsize2nsize3nmuch_longer_namen12345678.123nmid_size_namen12nWeasernAlfalfanStimeynBuckwheatnPorkynJoenDarlanCottonnButchnFroggynMrs_CrabapplenP.D.n19nMr._FrenchnJodynBuffynSissynKeithnDannynLorinChrisnShirleynMarshanJannCindynCarolnMikenGregnPeternBobbynAlicenRubennnnSample Outputn------------------------------------------------------------n12345678.123 size-1n2short4me size2nmid_size_name size3nmuch_longer_name tinynshorter very_long_file_namen------------------------------------------------------------nAlfalfa Cotton Joe PorkynBuckwheat Darla Mrs_Crabapple StimeynButch Froggy P.D. Weasern------------------------------------------------------------nAlice Chris Jan Marsha RubennBobby Cindy Jody Mike ShirleynBuffy Danny Keith Mr._French SissynCarol Greg Lori Peter 问答