1031. Hello World for U (20)

最新推荐文章于 2022-11-29 08:50:46 发布

siukwan

最新推荐文章于 2022-11-29 08:50:46 发布

阅读量559

点赞数

分类专栏： PAT 文章标签： string

本文链接：https://blog.csdn.net/jmlikun/article/details/49838659

版权

PAT 专栏收录该内容

105 篇文章 0 订阅

订阅专栏

1.通过 n₁ = n₃ = max { k| k <= n₂ for all 3 <= n₂ <= N } with n₁ + n₂ + n₃ - 2 = N的条件，通过for循环求出最大的n1

//#include<string>
//#include <iomanip>
#include<vector>
#include <algorithm>
//#include<stack>
#include<set>
#include<queue>
#include<map>
//#include<unordered_set>
//#include<unordered_map>
//#include <sstream>
//#include "func.h"
//#include <list>
#include<stdio.h>
#include<iostream>
#include<string>
#include<memory.h>
#include<limits.h>
using namespace std;

int main(void)
{
	string s;
	cin >> s;
	int n = s.size();
	int n1 = 0, n2 = 0;
	for (int i = 0; i < n; i++)
	{//求出n1的最大值
		n1 = i;
		n2 = n + 2 - 2 * n1;
		if (n2 < n1) break;
	}
	if (n2 < n1)
		n1--;
	n2 = n + 2 - 2 * n1;
	string mid = "";
	for (int i = 0; i < n2 - 2; i++)
		mid += " ";

	for (int i = 0; i < n1 - 1; i++)
	{
		cout << s[i] << mid << s[s.size() - 1 - i] << endl;
	}
	for (int i = n1 - 1; i < n1 - 1 + n2; i++)
	{
		cout << s[i];
	}
	cout << endl;
	return 0;
}