1031. Hello World for U (20)
来源:互联网 发布:国鑫金服行情软件 编辑:程序博客网 时间:2024/06/03 21:40
1031. Hello World for U (20)
时间限制400 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueGiven any string of N (>=5) characters, you are asked to form the characters into the shape of U. For example, "helloworld" can be printed as:
h de ll rlowoThat is, the characters must be printed in the original order, starting top-down from the left vertical line with n1characters, then left to right along the bottom line with n2 characters, and finally bottom-up along the vertical line with n3 characters. And more, we would like U to be as squared as possible -- that is, it must be satisfied that n1 = n3 = max { k| k <= n2 for all 3 <= n2 <= N } with n1 + n2 + n3 - 2 = N.Input Specification:
Each input file contains one test case. Each case contains one string with no less than 5 and no more than 80 characters in a line. The string contains no white space.
Output Specification:
For each test case, print the input string in the shape of U as specified in the description.
Sample Input:helloworld!Sample Output:h !e dl llowor对于一个字符串,把它尽量的弄成正方形的u;题目中的n1和n3为左右数量包括最后一行的头尾,n2为最后一行的数量。所以n1+n2+n3=N-2;
代码中的left_1=n1-1=(len-1)/3这里减一是为了不数最后一行的头;wordspacing=n2-2一行空格数;
#include<string> 字符串处理 用到substr(起始位置的标号,要输出的个数);比如 HelloWorld="12345";HelloWorld.substr(1, 3)那么输出从HelloWorld[1]开始向后输出3个为234;
N>=5
1.
12345
得
1 5
234
2.
123456
得
1 6
2345
3.
1234567
得
1 7
2 6
345
评测结果
时间 结果 得分 题目 语言 用时(ms) 内存(kB) 用户 8月02日 09:17答案正确201031C++ (g++ 4.7.2)1308datrilla测试点
测试点 结果 用时(ms) 内存(kB) 得分/满分 0答案正确12568/81答案正确13082/22答案正确11802/23答案正确13082/24答案正确13042/25答案正确13082/26答案正确11802/2
#include<iostream> #include<string>using namespace std; void worldspace(int size){ for (int index = 0; index < size; index++) cout << " ";}int main(){ string HelloWorld; int left_1, len,index,wordspacing; cin >> HelloWorld; len = HelloWorld.size(); left_1 = (len -1)/ 3; wordspacing = len - 2 * left_1 - 2; for (index = 0; index < left_1; index++) { cout << HelloWorld[index]; worldspace(wordspacing); cout << HelloWorld[len - 1 - index] << endl;; } cout << HelloWorld.substr(left_1, wordspacing+2) << endl; system("pause"); return 0;}
0 0
- 1031. Hello World for U (20)
- 1031. Hello World for U (20)-PAT
- 【PAT】1031. Hello World for U (20)
- 1031. Hello World for U (20)
- 1031. Hello World for U (20)
- 1031. Hello World for U (20)
- PAT 1031. Hello World for U (20)
- PAT 1031. Hello World for U (20)
- 1031. Hello World for U (20)
- PAT 1031. Hello World for U (20)
- 1031. Hello World for U (20)
- 1031. Hello World for U (20)
- 1031. Hello World for U (20)
- 1031. Hello World for U (20)
- 1031. Hello World for U (20)
- 1031. Hello World for U (20)
- 1031. Hello World for U (20)
- 1031. Hello World for U (20)
- A Simple Review Of 《Query Languages for Graph Databases》(I)
- 我在CSDN的开始
- linux FTP配置
- 一些工具类
- 在64位ubuntu上编译kitkat4.4时遇到HashSet_jni.h错误导致编译中止的问题
- 1031. Hello World for U (20)
- 【登录异常解决】Ubuntu 输入正确的密码后重新返回到登陆界面
- shell内部命令-----变量类
- HDUOJ Train Problem I
- 【POJ3181】【Dollar Dayz】
- 子集生成
- 过滤器参考
- 【转】【阮一峰】为什么Lisp语言如此先进?(译文)
- dlopen 方式调用 Linux 的动态链接库