UVa 400 打印列优先表
2016-06-04 19:43
239 查看
Unix ls
Submit Status
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 (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.
).
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
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.
to 2R listed down column 2; etc.
水题照题意写就行
Time Limit: 3000MS | Memory Limit: Unknown | 64bit IO Format: %lld & %llu |
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 (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+1to 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
水题照题意写就行
#include <iostream> #include <string> #include <algorithm> using namespace std; int main() { int n; while(cin>>n){ int maxlen=0; string str[105]; for(int i=0;i<n;i++){ cin>>str[i]; int x=str[i].length(); maxlen=max(maxlen,x); } int cnum=(60-maxlen)/(maxlen+2)+1; int lnum=(n-1)/cnum+1; sort(str,str+n); for(int i=0;i<60;i++) cout<<'-'; cout<<endl; for(int i=0;i<lnum;i++){ int k=0; for(int j=0;j<cnum;j++,k+=lnum) { cout<<str[i+k]; int len=str[i+k].size(); int temp=maxlen-len+2; if(j==cnum-1) temp-=2; for(int p=0;p<temp;p++) cout<<' '; } cout<<endl; } } }
相关文章推荐
- RUEI 13.1.1版本在OEL 5.7上的安装
- 第十四周学习进度表
- [DP] [贪心] [Vijos P1417] 魔法塔防 (mtower)
- 第12期 【稳耐风波愿始从】 6月刊
- Java EE — Servlet 01 Servlet 开发流程
- 数据之间的转化神器--map
- 互联网领域常见的数据存储方式
- PULL解析入门
- 个人最终总结
- Javascript模块化编程:require.js的用法
- 简单的页面置换算法分析
- python爬虫的使用
- SpringMVC注入Spring的bean
- Hibernate-投影查询
- 在Linux下用C语言写一个小程序实现一个进度条编写Makefile来进行运行
- 初探tcp和udp
- android studio for android learning (六)应用程序窗体显示状态操作(requestWindowFeature等的应用)
- Lowest Common Ancestor of a Binary Tree
- 个人总结
- ASP.NET Web API自身对CORS的支持: CORS授权检验的实施