1031 Hello World for U (20 分)

Posted 2022-02-06 zllwxm123

1031 Hello World for U (20 分)

 

Given any string of N (≥) 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 n?1??characters, then left to right along the bottom line with n?2?? characters, and finally bottom-up along the vertical line with n?3?? characters. And more, we would like U to be as squared as possible -- that is, it must be satisfied that n?1??=n?3??=max  k | k≤n?2?? for all 3  with n?1??+n?2??+n?3??−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

模拟一下

 1 #include <bits/stdc++.h>
 2 
 3 using namespace std;
 4 string s;
 5 
 6 int main()
 7     cin >> s;
 8     int len = s.length() + 2;
 9     int an = len/3;
10     int ans = s.length() - an*2;
11     int left = 0, right = s.length() -1;
12     for(int i = 1; i < an; i++)
13         cout <<s[left++];
14         for(int j = 0; j < ans; j++)
15             cout <<" ";
16         cout <<s[right--]<<endl;
17     
18     for(int i = left; i <= right; i++)
19         cout <<s[i];
20     
21     cout << endl;
22     return 0;
23