PAT甲级刷题记录——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, helloworldcan 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​₁​​ characters, then left to right along the bottom line with n​₂​​ characters, and finally bottom-up along the vertical line with n​₃​​ characters. And more, we would like Uto be as squared as possible – that is, it must be satisfied that n​₁​​ =n_​3​​ =max { k | k≤n​₂​​ for all 3≤n​₂​​ ≤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

思路

这题其实就是一个数学题哈，只要计算出n1 = (N+2)/3这个关系式，其他的n2、n3都可以推导出来（n3 = n1，n2 = N+2-n1-n3）。

然后按照要求输出就好啦~

代码

#include<cstdio>
#include<math.h>
#include<stdlib.h>
#include<algorithm>
#include<string>
#include<string.h>
#include<iostream>
using namespace std;
int main()
{
    string s;
    cin>>s;
    int n1, n2, n3;
    int N = s.length();
    n1 = (N+2)/3;
    n3 = n1;
    n2 = N+2-n1-n3;
    for(int i=0;i<n1;i++){
        if(i!=n1-1){
            cout<<s[i];
            for(int j=1;j<=n2-2;j++) cout<<' ';
            cout<<s[N-i-1];
        }
        else{
            for(int j=i;j<i+n2;j++){
                cout<<s[j];
            }
        }
        cout<<'\n';
    }
    return 0;
}