1031. 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  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
  
  
对于一个字符串，把它尽量的弄成正方形的u；题目中的n1和n3为左右数量包括最后一行的头尾，n2为最后一行的数量。所以n1+n2+n3=N-2；
  
  
代码中的left_1=n1-1=(len-1)/3这里减一是为了不数最后一行的头;wordspacing=n2-2一行空格数；
#include<string> 字符串处理 用到substr（起始位置的标号，要输出的个数）；
比如 HelloWorld="12345";HelloWorld.substr(1, 3)那么输出从HelloWorld[1]开始向后输出3个为234；
  
  
N>=5
  
  
1.
  
  
12345
  
  
得
  
  
1 5
234
2.
123456
得
1  6
2345
3.
1234567
得
1 7
2 6
345 

 
 

评测结果
 
 
时间
结果
得分
题目
语言
用时(ms)
内存(kB)
用户
8月02日
 09:17
答案正确
20
1031
C++
 (g++ 4.7.2)
1
308
datrilla
测试点
 
 
测试点
结果
用时(ms)
内存(kB)
得分/满分
0
答案正确
1
256
8/8
1
答案正确
1
308
2/2
2
答案正确
1
180
2/2
3
答案正确
1
308
2/2
4
答案正确
1
304
2/2
5
答案正确
1
308
2/2
6
答案正确
1
180
2/2

#include<iostream>   
#include<string>
using namespace std;  
void worldspace(int size)
{
  for (int index = 0; index < size; index++)
    cout << " ";
}
int main()
{   
  string HelloWorld;
  int left_1, len,index,wordspacing;
  cin >> HelloWorld;
  len = HelloWorld.size();
  left_1 = (len -1)/ 3;
  wordspacing = len - 2 * left_1 - 2;
  for (index = 0; index < left_1; index++)
  {
    cout << HelloWorld[index];
    worldspace(wordspacing);
    cout << HelloWorld[len - 1 - index] << endl;;
  }
  cout << HelloWorld.substr(left_1, wordspacing+2) << endl;
  system("pause");
  return 0;
}