1031 Hello World for U

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

 solution:
 

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl '\n'
int main()
{
	string s;
	cin>>s;
	int n=s.size();
	int minn=INT_MAX;
	int mi,mj;
	for(int j=3;j<=n;j++)//n2
	{
		for(int i=1;i<=j;i++)//n1
		{
			if(2*i+j-2==n)
			{
				int cnt=abs(i-j);
				if(cnt<minn)
				{
					minn=cnt;
					mi=i;
					mj=j;
				}
			}
		}
	}
	vector<vector<char> >a(mi,vector<char>(mj,' '));
	int cnt=0;
	for(int i=0;i<mi;i++)//down
	{
		a[i][0]=s[cnt++];
	}
	for(int i=1;i<mj;i++)//right
	{
		a[mi-1][i]=s[cnt++];
	}
	for(int i=mi-2;i>=0;i--)//up
	{
		a[i][mj-1]=s[cnt++];
	}
	for(int i=0;i<mi;i++)
	{
		for(int j=0;j<mj;j++)
		{
			cout<<a[i][j];
		}
		cout<<endl;
	}
}