PAT 1031 Hello World for U

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

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define maxnum 100005

char ans[][];

int main(){
    memset(ans,' ', sizeof(ans));
    string s;
    cin >> s;
    int N = s.size();
    int n1,n2,n3;
    n1 = n3 = (N+)/;
    n2 = (N+)% + n1;
    for(int i=;i < n1;i++){
        ans[i][] = s[i];
    }
    for(int i=;i < n2;i++){
        ans[n1-][i] = s[n1-+i];
    }
    for(int i=n3-;i >= ;i--){
        ans[i][n2-] = s[n1+n2-+(n3--i)];
    }

    for(int i=;i < n1;i++){
        for(int j=;j < n2;j++){
            cout << ans[i][j];
        }
        if(i != n1)cout << endl;
    }

    return ;
}

当提交出现全错的情况说明输出格式错了，比如这题，没有memset char数组是不对的，以后所有数组记得要初始化。