1031 Hello World for U

分数 20

作者 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:

hdellrlowo

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.

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

* 因为 n1 + n2 +n3 == len + 2, 所以将 len + 2 除以3，向下取整给n1 和 n3, 剩下的字符给
* n2即可。

/** * 因为 n1 + n2 +n3 == len + 2, 所以将 len + 2 除以3，向下取整给n1 和 n3, 剩下的字符给 * n2即可。*/#include #include using namespace std;int main(){string s;cin >> s;int len=s.size() + 2;int n1,n3;n1 = n3 = len/3;int n2 = len - 2 - n1 - n3; //n2表示最后一行字符不算左右边缘上的字符数目string spa(n2, ' ');for(int i=0; i<n1-1; ++i)cout << s[i] << spa << s[len-3-i] << endl;for(int i=n1-1, j=0; j<n2+2; ++i, ++j)cout << s[i];puts("");return 0;}