-
题目描述:
-
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 d l l lowor a m c o . c jobdu.
-
#include <iostream> #include <cstdio> #include <cstring> using namespace std; int main() { char a[99]; int i,j,len,s,e; while(scanf("%s",a)!=EOF)//开始写的是gets(a)!=NULL,无限WRONG,本来秒过的题目,坑了好久,不过为什么不行。我还不是很清楚,求大神指点 { len=strlen(a)+2; int n1,n2; n1=len/3; n2=len-n1*2; n1-=1; s=0; e=len-2-1; while(n1--) { printf("%c",a[s++]); for(i=0;i<n2-2;i++) printf(" "); printf("%c",a[e--]); puts(""); } for(i=s;i<=e;i++) printf("%c",a[i]); puts(""); } return 0; }