九度oj-1464-Hello World for U

时间限制：1 秒

内存限制：128 兆

特殊判题：否

提交：4698

解决：1316

题目描述：

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.

输入：

There are multiple test cases.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.

输出：

For each test case, print the input string in the shape of U as specified in the description.

样例输入：

helloworld!ac.jobdu.com

样例输出：

h   !e   dl   llowora    mc    o.    cjobdu.

来源：

2012年浙江大学计算机及软件工程研究生机试真题

#include<iostream>#include<cstring>using namespace std;string a;int main(){    int i,j,n,n1,n2;    while(cin>>a)    {        n=a.length();        n1=(n+2)/3;        n1--;        n2=n-n1*2;        //cout<<n<<"  "<<n1<<"  "<<n2<<endl;        for(i=0;i<n1;i++)        {            cout<<a[i];            for(j=0;j<n2-2;j++)                cout<<" ";            cout<<a[n-i-1]<<endl;        }        for(i=n1;i<n1+n2-1;i++)            cout<<a[i];        cout<<a[n1+n2-1]<<endl;    }    return 0;}