1031. Hello World for U (20)
时间限制
400 ms
内存限制
32000 kB
代码长度限制
16000 B
判题程序
Standard
作者
CHEN, Yue
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 lowoThat is, the characters must be printed in the original order, starting top-down from the left vertical line with n 1characters, then left to right along the bottom line with n 2 characters, and finally bottom-up along the vertical line with n 3 characters. And more, we would like U to be as squared as possible -- that is, it must be satisfied that n 1 = n 3 = max { k| k <= n 2 for all 3 <= n 2 <= N } with n 1 + n 2 + n 3 - 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 d l l lowor
推荐指数:※
#include <iostream> #include <string> #include <string.h> using namespace std; #define N 81 int main() { int i,j,n,n1,n2,n3; char str[N]; cin.get(str,N); n=0; while(str[n]!='\0') n++; n1=(n+2)/3-1; n2=n-2*n1; for(i=0;i<n1;i++){ cout<<str[i]; for(j=0;j<n2-2;j++) cout<<" "; cout<<str[n-i-1]<<endl; } for(j=i;j<n-i;j++) cout<<str[j]; return 0; }