1031 Hello World for U (20分)

Given any string of N (≥) 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 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 } 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

测试点5没过

 #define _CRT_SECURE_NO_WARNINGS
 #include <climits>
 #include<iostream>
 #include<vector>
 #include<queue>
 #include<stack>
 #include<algorithm>
 #include<string>
 #include<cmath>
 using namespace std;
 void printBlock(int n)
 {
     while (n--)
         cout << " ";
 }
 int main()
 {
     string s;
     cin >> s;
     int N = s.length() - ;
     int n1=, n2=;
     int flag = ;
     for (n2 = ; n2 <= N; n2++)
     {
         for (n1=;n1 <= n2; n1++)
             if ( * n1 + n2 == s.length())
             {
                 flag = ;
                 break;
             }
         if (flag)
             break;
     }
     for (int i = ; i < n1; i++)
     {
         cout << s[i];
         printBlock(n2 - );
         cout << s[s.length() - i - ] << endl;
     }
     cout << s.substr(n1, n2);
     return ;
 }