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 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

**解题思路，可以知道必须尽可能接近U形，所以有这个规律，N+2除以3，它必须是两侧的，所以可以求得每列与行的个数，a[ n1 ] [n2+1[用二维数组保存结果
先空格初始化，然后注意赋值下标的变化。
**

#include<stdio.h>
#include<string.h>
#include<iostream>
using namespace std;
 int main(){
 	char c[100];
 	scanf("%s",c);
	int N = strlen(c);

 	int n1 = (N+2)/3;
 	int n3 = n1;
 	int n2 = N +2 - n1 - n3;
 	
 	char a[n1][n2+1];
 	for(int i = 0; i < n1; i++){
 		for(int j = 0; j < n2; j++)
 			a[i][j] = ' ';
	 }
	 int i;
	 for(i = 0;i < n1;i++){
	 	a[i][0] = c[i];
	 }
	 //i记录输出到的位置
	 int k = i - 1;
	 int j;
	 for( j = 1; j < n2; j++){
	 	a[k][j] = c[i++];
	 } 


	 for(int h = n3-2;h >=0 ; h--){
	 	a[h][n2-1] = c[i++];
	 }
	 
	 for(int i = 0; i < n1; i++){
 		for(int j = 0; j < n2; j++)
 			printf("%c",a[i][j]);
 		printf("\n");
	 }
	return 0;
 }