2018_2_9_Unix ls_格式_sort_字符串
2018-02-09 14:37
141 查看
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). 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 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.
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
Your 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.
Input The 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.
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.
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 RubenSample 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
#include<iostream> #include<cstdio> #include<cstring> #include<string> #include<cctype> #include<vector> #include<algorithm> #include<map> #include<set> using namespace std; char c[65]; vector<string> v; int main(){ int n; while(scanf("%d",&n)!=EOF){ for(int i=0;i<60;i++) putchar('-'); putchar('\n'); getchar(); v.clear(); int maxl=-1; for(int i=0;i<n;i++){ gets(c); int len=strlen(c); if(maxl<len)maxl=len; v.push_back(c); } sort(v.begin(),v.end()); int c=62/(maxl+2); int r=(n-1)/c+1; vector<string> ans(r); int k=0; for(int i=0;i<c-1;i++) for(int j=0;j<r;j++){ ans[j]+=v[k]; for(int t=v[k++].size();t<maxl+2;t++)ans[j]+=' '; } int vsize=v.size(); for(int j=0;j<r&&k<vsize;j++) ans[j]+=v[k++]; for(int i=0;i<r;i++) cout<<ans[i]<<endl; } }
相关文章推荐
- Java将Unix时间戳转换成指定格式日期字符串工具类
- linux c++ 字符串时间格式转unix timestamp
- uva400 unix ls (字符串 排序)
- UNIX下的ls命令的输出格式(ZT)
- php将标准字符串格式时间转换成unix时间戳_strtotime
- [UVA400]Unix ls[格式输出]
- php将标准字符串格式时间转换成unix时间戳_strtotime
- uva 400 Unix ls(借助printf("%*s",int, char*);控制格式)
- UVA 400-Unix ls【字符串】
- UVa--400 Unix ls(格式输出)
- php中把“2011-03-17 23:59:00”格式的字符串转化为UNIX 时间戳
- 2018_2_10_Football Sort大模拟题_排序__格式
- UVa 400 Unix ls (字符串排序&规格化输出)
- #UVA 400 Unix ls (string + sort( ) )
- 2018_2_9_ShellSort _字符串_模拟_巧妙
- unix时间戳转换成指定格式日期的字符串 java
- POJ 1589 Unix ls 排序和字符串处理
- sscanf() - 从一个字符串中读进与指定格式相符的数据.
- Python2.7 中文乱码、输入字符串格式 问题
- objective-c获得字符串格式的当前时间