[C++知识库]1031 Hello World for

1031 Hello World for U

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   d
l   l
lowor

#include<cstdio>
#include<string.h>
#include<algorithm>
using namespace std;

int main()
{
  char str[85];
  scanf_s("%s", &str, sizeof(char) * 85);
  int N = strlen(str);
  int n1;
  int n2=3;

  for (n1 = 1; n1 <= N + 2 - 2 * n1 && N + 2 - 2 * n1 >=3; n1++)
  {
    n2 = N + 2 - 2 * n1;
  }
  n1--;

  int i = 0;
  for (; i < n1-1; i++)
  {
    printf("%c", str[i]);
    for (int j = 0; j < n2 - 2; j++)
    {
      printf(" ");
    }
    printf("%c\n", str[N - 1 - i]);
  }
  for (; i < N - n1 + 1; i++)
  {
    printf("%c", str[i]);
  }
  printf("\n");
}