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
n1
characters, then left to right along the bottom line withn2
characters, and finally bottom-up along the vertical line withn3
characters. And more, we would like U to be as squared as possible – that is, it must be satisfied thatn1=n3=max { k | k≤n2 for all 3≤n2 ≤N }
withn1 +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
这题挺好理解的。反正我没翻译的时候就理解了点。
就是把一个字符串改写成U的形式。
代码如下:
#include<bits/stdc++.h>
using namespace std;
int main()
{
string a;
cin>>a;
int N = a.length();
int n1, n2, n3;
n1 = (N+2)/3;//向下取整
n3 = n1;
n2 = N - n1 - n3 + 2;
int p=0, q=N-1;
for( int i=0; i<n1-1; i++)//把第n-1排先输出
{
printf("%c",a[p]);
for(int j=0; j<n2-2; j++)//中间还有空格呢,输出空格
{
printf(" ");
}
printf("%c\n",a[q]);//空格输出完了就该输出右边那排了。
p++;
q--;
}
for( int i=p; i<=q; i++)
{
printf("%c",a[i]);
}
return 0;
}