1. 程式人生 > 其它 >1031 Hello World for U(20分)

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 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 | kn2 for all 3n2N } with n1+n2+n32=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

只要先把n1和n2確定出來,題目就變成了簡單的列印題

 1 #include<bits/stdc++.h>
 2 using namespace std;
 3 int main(){
 4     char word[100
]; 5 memset(word,0,sizeof(word)); 6 cin>>word; 7 int n=strlen(word); 8 int n1=(n+2)/3; 9 int n2=n+2-n1*2; 10 int k=0; 11 for(int i=0;i<n1;++i){ 12 if (i!=n1-1){ 13 cout<<word[k]; 14 for (int j=0;j<n2-2;++j){ 15 cout<<" "; 16 } 17 cout<<word[n-1-k]<<endl; 18 k++; 19 20 } 21 else{ 22 for(int j=k;j<k+n2;++j){ 23 cout<<word[j]; 24 } 25 break; 26 } 27 } 28 }