题目1464:Hello World for U
2014-02-23 21:25
309 查看
题目描述:
Given 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 d
e l
l r
lowo
That is, the characters must be printed in the original order, starting top-down from the left vertical line with n1 characters, 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.
输入:
There are multiple test cases.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.
输出:
For each test case, print the input string in the shape of U as specified in the description.
样例输入:
样例输出:
Given 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 d
e l
l r
lowo
That is, the characters must be printed in the original order, starting top-down from the left vertical line with n1 characters, 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.
输入:
There are multiple test cases.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.
输出:
For each test case, print the input string in the shape of U as specified in the description.
样例输入:
helloworld! ac.jobdu.com
样例输出:
h ! e d l l lowor a m c o . c jobdu.
#include <iostream> using namespace std; int main() { string str; while(cin>>str) { int N = 0,n1=0,n2=0; N = str.size()+2; n1 =int(N/3); n2 = N-n1-n1; for(int i=0;i<n1-1;i++) { cout<<str[i]; for(int j=1;j<=n2-2;j++) cout<<" "; cout<<str[N-2-1-i]; cout<<endl; } for(int i=n1-1;i<n1-1+n2;i++) cout<<str[i]; cout<<endl; } return 0; } /************************************************************** Problem: 1464 User: 小燧石 Language: C++ Result: Accepted Time:10 ms Memory:1520 kb ****************************************************************/
相关文章推荐
- 开篇:序
- X宝外包软件测试工程师面试经历
- 电子类笔试题(包括模拟电路、IC基础、数字电路、微机)
- 《30天自制操作系统》学习笔记——第十一天
- bzoj 1833 [ZJOI2010] count 数字计数 题解
- VMWare下虚拟机ubuntu 和 windows文件共享
- 开篇:序
- 题目1202:排序
- 【Oracle】学习中所遇所学
- Codeforces 260D - Black and White Tree
- CSS学习拾遗
- Linux学习笔记(二)——文件、目录与磁盘格式
- 开篇:序
- ORACLE record is locked by another user?解锁
- AOP实践:java.lang.instrument的使用
- convert(varchar(10),字段名,转换格式
- 【转】iframe页面跳转时,导致父页面滚动!该怎么解决?
- 题目1185:特殊排序
- cocos2d-x基本信息
- 开篇:序