PAT 甲级 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 ₁ characters, then left to right along the bottom line with n ₂  characters, and finally bottom-up along the vertical line with n ₃  characters. And more, we would like U to be as squared as possible -- that is, it must be satisfied that n ₁  = n ₃  = max { k| k <= n ₂  for all 3 <= n ₂  <= N } with n ₁  + n ₂  + n ₃  - 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 <cstdio>
#include <string.h>
using namespace std;

int main()
{
    char u[30][30];
    char c[81];
    memset(u,' ',sizeof(u));
    scanf("%s",c);
    int n=strlen(c)+2;
    int n1=n/3;
    int n2=n/3+n%3;
    int index=0;
    for(int i=0;i<n1;i++){
        u[i][0]=c[index++];
    }
    for(int i=1;i<=n2-2;i++){
        u[n1-1][i]=c[index++];
    }
    for(int i=n1-1;i>=0;i--){
        u[i][n2-1]=c[index++];
    }
    for(int i=0;i<n1;i++){
        for(int j=0;j<n2;j++){
            cout<<u[i][j];
        }
        cout<<endl;
    }
    return 0;
}