UVA 400 Unix ls
2015-08-21 10:04
375 查看
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 formatterfor 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 (ascendingbased 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 rightmostcolumn 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 beingfilled 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<algorithm>#include<string>#include<stdio.h>using namespace std;string ss[107];int main(){int n;while(scanf("%d",&n)!=EOF){for(int i=0;i<60;i++){cout<<"-";}cout<<endl;int l;l=0;for(int i=0;i<n;i++){cin>>ss[i];if(l<ss[i].length())l=ss[i].length();}int h=(60-l)/(l+ 2)+1;int p=(n-1)/h+1;sort(ss,ss+n);for(int i=0;i<p;i++){for(int j=0;j<h;j++){int t=j*p+i;if(t<n){cout<<ss[t];if(j==h-1){for(int b=0;b<l-ss[t].length();b++)cout<<" ";}else{for(int b=0;b<l+2-ss[t].length();b++)cout<<" ";}}}cout<<endl;}}}
相关文章推荐
- quagga实现 isis路由(1)
- MagicalRecord使用教程
- [leetcode-160]Intersection of Two Linked Lists(c)
- tomcat为什么要禁用session?
- 解决lists标签中,加上where后其他条件失效的问题
- zz
- [Java] 读取文件
- Android ftp 上传图片
- OSCache EhCache
- java学习之内部类
- JAVA-QUEUE类图
- 9.11排序与查找(五)——有个排序后的字符串数组,其中散布着一些空字符串,找出给定字符串的位置
- 【leetcode】Substring with Concatenation of All Words
- HDU - 5410 CRB and His Birthday
- 监听手指左右滑动屏幕的事件,封装好了一个类
- 中兴应用之星携手天翼开放平台:让APP开发更简单
- 高德地图远程获取手机的敏感信息可远程命令执行(可以远程利用非webview)
- POJ 2479 (后附 POJ 2593) DP
- WinForm绘制圆角的方法
- 生成工单操作流程