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<stdio.h>
#include<string.h>

using namespace std;

#define MAX 81

/**计算n1和n3的长度**/
int computeN1andN3(int len){
	int max = 0;
	for(int i = 1; i < len; i++){
		int n2 = len-i*2+2;
		if(i <= n2 && n2 >= 3 && n2 <= len && i > max){
			max = i;
		}
	}
	return max;
}

int main(){
	char str[MAX] = {};
	scanf("%s", str);
	int n1 = computeN1andN3(strlen(str));
	int n2 = strlen(str)-n1*2+2;
	int i = 0;
	for(; i < n1-1; i++){
		printf("%c", str[i]);
		int j = 0;
		while(j < n2-2){
			printf(" ");
			j++;
		}
		printf("%c\n", str[strlen(str)-i-1]);
	}
	int len = strlen(str)-i-1;
	for(; i <= len; i++){
		printf("%c", str[i]);
	}
	return 0;
}