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 1 characters, 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> using namespace std; int main() { string input = ""; int n1, n2, n3; cin >> input; n1 = n2 = (input.size() - input.size()%3) / 3; n3 = input.size() - n1 * 2; for (int i = 0; i < n1; ++i) { cout << input[i]; for (int j = 0; j < n3 - 2; ++j) cout << " "; cout << input[input.size() - i - 1] << endl; } for (int i = n1; i < input.size() - n1; ++i) { cout << input[i]; } return 0; }