洛谷P1259 黑白棋子的移动进阶解法

最新推荐文章于 2025-10-25 22:57:45 发布

原创最新推荐文章于 2025-10-25 22:57:45 发布 · 244 阅读

0 ·

CC 4.0 BY-SA版权

程序设计代码共享专栏收录该内容

183 篇文章

订阅专栏

#include<iostream>

using namespace std;
int N;

int main()
{
	cin >> N;
	for (int i = N; i > 3; i--)
	{
		for (int j = 0; j < i; j++)
			cout << 'o';
		for (int j = 0; j < i; j++)
			cout << '*';
		cout << "--";
		for (int j = i; j < N; j++)
			cout << "o*";
		cout << endl;
		for (int j = 0; j < i - 1; j++)
			cout << 'o';
		cout << "--";
		for (int j = 0; j < i - 1; j++)
			cout << '*';
		cout << "o*";
		for (int j = i; j < N; j++)
			cout << "o*";
		cout << endl;
	}
	cout << "ooo*o**--*";
	for (int i = 0; i < N - 4; i++)
		cout << "o*";
	cout << endl << "o--*o**oo*";
	for (int i = 0; i < N - 4; i++)
		cout << "o*";
	cout << endl << "o*o*o*--o*";
	for (int i = 0; i < N - 4; i++)
		cout << "o*";
	cout << endl << "--o*o*o*o*";
	for (int i = 0; i < N - 4; i++)
		cout << "o*";
	return 0;
}