PAT A1031 Hello World for U

PAT A1031 Hello World for U

Sample Input:

helloworld!

Sample Output:

h   !
e   d
l   l
lowor

word	meaning
left vertical line	左垂直线

• 解释：左右列元素的个数**不超过(<=)**最下面行元素的个数，且总个数为n+2

换一种方式就是2*n1+n2 = n && n1 < n2 等价于：3 * n1 < n:

所以用一个for循环不断试探，直到不满足条件就break（n1达到最大值）;

• code1:

#include <stdio.h>
#include <string>
#include <iostream>
using namespace std;
int main(){
	string s;
	cin >> s;
	int len = s.size();
	int n1;
	for(int i = 0; i < len/2; ++i){
		if(3 * i < len) n1 = i;
	}	
	for(int i = 0; i < n1; ++i){
		printf("%c", s[i]);
		for(int j = 2; j < len - 2*n1; ++j){
			printf(" ");
		}
		printf("%c\n", s[len-1-i]);
	}
	for(int i = n1; i < len - n1; ++i){
		printf("%c", s[i]);
	}
	return 0;
}

• T2 code：

#include <bits/stdc++.h>
using namespace std;
int GetN1(int n){
	for(int n2 = 3; n2 <= n; ++n2){
		int n1 = n + 2 - n2;
		if(n1 <= 2 * i) return n1 / 2;
	}
}

int main(){
	string s;
	cin >> s;
	int len = s.size();
	int row = GetN1(len);
	int col = len - row * 2 + 2;
	for(int i = 0; i < row-1; ++i){
		printf("%c", s[i]);
		for(int j = 1; j < col-1; ++j){
			printf(" ");
		}
		printf("%c\n", s[len-1-i]);
	}
	for(int i = 0; i < col; ++i){
		printf("%c", s[row-1+i]);
	}
	return 0;
}

T3 code:

#include <bits/stdc++.h>
using namespace std;

int main()
{
    string in;
    cin >> in;
    int rows = (in.size() - 1) / 3;
    int cols = in.size() - 2 * rows;
    string end_row = in.substr(rows, cols), space(cols - 2, ' ');
    for(int i = 0; i < rows; ++i)
    {
        cout <<in[i] <<space <<in[in.size()-1-i] <<endl;
    }
    cout << end_row;
    return 0;
}