Alignment of Code UVA
来源:互联网 发布:端口费用是什么意思 编辑:程序博客网 时间:2024/05/23 00:04
Alignment of Code UVA - 1593
You are working in a team that writes Incredibly Customizable Programming Codewriter (ICPC) which
is basically a text editor with bells and whistles. You are working on a module that takes a piece of
code containing some definitions or other tabular information and aligns each column on a fixed vertical
position, while keeping the resulting code as short as possible, making sure that only whitespaces that
are absolutely required stay in the code. So, that the first words on each line are printed at position
p1 = 1; the second words on each line are printed at the minimal possible position p2, such that all first
words end at or before position p2 − 2; the third words on each line are printed at the minimal possible
position p3, such that all second words end at or before position p3 − 2, etc.
For the purpose of this problem, the code consists of multiple lines. Each line consists of one or
more words separated by spaces. Each word can contain uppercase and lowercase Latin letters, all
ASCII punctuation marks, separators, and other non-whitespace ASCII characters (ASCII codes 33 to
126 inclusive). Whitespace consists of space characters (ASCII code 32).
Input
The input file contains one or more lines of the code up to the end of file. All lines (including the last
one) are terminated by a standard end-of-line sequence in the file. Each line contains at least one word,
each word is 1 to 80 characters long (inclusive). Words are separated by one or more spaces. Lines of
the code can have both leading and trailing spaces. Each line in the input file is at most 180 characters
long. There are at most 1000 lines in the input file.
Output
Write to the output file the reformatted, aligned code that consists of the same number of lines, with
the same words in the same order, without trailing and leading spaces, separated by one or more spaces
such that i-th word on each line starts at the same position pi
.
Note for the Sample:
The ‘⊔’ character in the example below denotes a space character in the actual files (ASCII code
32).
Sample Input
␣␣start:␣␣integer;␣␣␣␣//␣begins␣here
stop:␣integer;␣//␣␣ends␣here
␣s:␣␣string;
c:␣␣␣char;␣//␣temp
Sample Output
start:␣integer;␣//␣begins␣here
stop:␣␣integer;␣//␣ends␣␣␣here
s:␣␣␣␣␣string;
c:␣␣␣␣␣char;␣␣␣␣//␣temp
题目大意:输入若干行代码,要求各列单词的左边界对齐切尽量靠左,单词之间至少要空一格。每个单词不超过80个字符,每行不超过180个字符,一共最多1000行。
解题思路:就是按照要求对齐输入需要注意的是输入的处理对输入的单词要按行输入保存单词分开存,格式为间隔与最长的单词长度加1;
ac代码()
include
- Uva Alignment of Code
- Alignment of Code UVA
- Alignment of Code UVA
- UVa 1593 Alignment of Code
- UVa 1593 - Alignment of Code
- UVa 1593 - Alignment of Code
- UVa 1593 Alignment of Code
- Uva - 1593 - Alignment of Code
- UVA 1593 Alignment of Code
- UVa 1593 - Alignment of Code
- UVA 1593 Alignment of Code
- UVa 1593 Alignment of Code
- uva 1593 Alignment of Code
- UVA 1593 Alignment of Code
- UVa 1593 Alignment of Code(字符串)
- UVa--1593 Alignment of Code(string)
- UVA 1593(p135)----Alignment of Code
- UVa 1593 Alignment of code 解题报告
- *1115. Counting Nodes in a BST (30) <二叉搜索树>
- Java开发环境搭建-JDK的下载和安装
- java 对字符串中的字符自然排序
- Linux mount/unmount命令
- Error:warning: Ignoring InnerClasses attribute for an anonymous inner class
- Alignment of Code UVA
- java面试题:顺时针打印矩阵
- BZOJ 3123 森林 主席树启发式合并
- 改进方法--C#使用NSoup解析HTML的乱码解决
- Java面试题
- Noi2015 程序自动分析
- C++强制类型转换_0
- 1020. 月饼 (25)
- linux里挂载(mount)和取消挂载(umount)命令的使用