頑強(qiáng)的小白

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 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≤n?2??≤N } 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

題目解析

拷貝過來 那個(gè)U型散了，不會(huì)改，腦補(bǔ)吧。
題目?jī)?nèi)容就是他給你一個(gè)單詞（字符串）你要把它輸出為U型，為了讓這個(gè)型最好看，需要平衡三個(gè)邊的長(zhǎng)度，題目那個(gè)算兩邊長(zhǎng)度的公式好長(zhǎng)，但是仔細(xì)看就會(huì)發(fā)現(xiàn)其實(shí)只要三個(gè)邊長(zhǎng)度盡可能三等分就是最好的，如果不能三等分，就把多余的字母放在底部，還有注意題目中兩個(gè)邊的長(zhǎng)度是和底邊重疊了一個(gè)的。
剩下的就是輸出問題了，慢慢來就行了。

代碼實(shí)現(xiàn)

#include <cstdio> #include <cstring> using namespace std; int main(){int n1,n2;char word[100];scanf("%s",word);int len=strlen(word);len=len+2;n1=len/3;n2=len-2*n1;for(int i=0;i<n1-1;++i){printf("%c",word[i]);for(int j=0;j<n2-2;++j)printf(" ");printf("%c\n",word[len-3-i]);}for(int i=0;i<n2;++i){printf("%c",word[n1-1+i]);} }

總結(jié)

以上是生活随笔為你收集整理的PAT日志 1031的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。