zoukankan      html  css  js  c++  java
  • 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


     1 #include<iostream>
     2 using namespace std;
     3 int main(){
     4   string a;
     5   cin>>a;
     6   int len=a.size();
     7   int y=(len+2)/3;
     8   int x=len-y-y;
     9   for(int i=0; i<y-1; i++){
    10     cout<<a[i];
    11     for(int j=0; j<x; j++) cout<<" ";
    12     cout<<a[len-i-1];
    13     cout<<endl;
    14   }
    15   for(int k=0; k<x+2; k++)cout<<a[y+k-1];
    16   return 0;
    17 }
    有疑惑或者更好的解决方法的朋友,可以联系我,大家一起探讨。qq:1546431565
  • 相关阅读:
    awk书上练习
    矩阵运算
    从最大似然到EM算法浅解
    numpy 练习
    python lxml教程
    pycharm快捷键
    python正则表达式教程
    三门问题
    Solr本地服务器搭建及查询
    git简单使用
  • 原文地址:https://www.cnblogs.com/mr-stn/p/9153248.html
Copyright © 2011-2022 走看看