PAT (Advanced Level) Practise1031 Hello World for U (20)

1031. Hello World for U (20)

时间限制

400 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

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  de  ll  rlowo

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

直接算出有多少行多少列就好了

#include<cstdio>#include<cstring>#include<vector>#include<queue>#include<functional>#include<algorithm>using namespace std;typedef long long LL;const int maxn=1e5+10;const int mod=1e9+7;int n,m;char s[maxn];int main(){  scanf("%s",s);    n=(strlen(s)+2)/3;  m=strlen(s)+2-2*n;  for (int i=0;i<n;i++)  {    printf("%c",s[i]);    for (int j=1;j<m-1;j++)     {      if (i<n-1) printf(" ");      else printf("%c",s[i+j]);    }    printf("%c\n",s[strlen(s)-i-1]);  }  return 0;}