PAT甲级1031 Hello World for U

题目

1031 Hello World for U (20 分)
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
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 n3 characters. And more, we would like U to be as squared as possible – that is, it must be satisfied that n​1=n3=max { k | k≤n​2for 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<cstring>
#include<iostream>
#include<algorithm>
#include<cmath>

using namespace std;

int main()
{
   char hx[83];
   scanf("%s",hx);
   int len = strlen(hx);
   int temp,i;
   for(i=len;i>=0;i--)
   {
       temp = len+2-2*i;
       if(i <= temp)
        break;
   }
   for(int j=0;j<i-1;j++)
   {
       printf("%c",hx[j]);
       for(int k=0;k<temp-2;k++)
        printf(" ");
       printf("%c\n",hx[len-j-1]);
   }
   for(int j=0;j<temp;j++)
    printf("%c",hx[i+j-1]);
    return 0;
}