洛谷P1259 黑白棋子的移动 题解

这是题解,快让我过

#include<iostream>
#include<cmath>
using namespace std;
/*
oooo****--
ooo--***o*
ooo*o**--*
o--*o**oo*
o*o*o*--o*
--o*o*o*o*
*/
int n;
char arr[300];
void chessman(int g)
{
	if (g > 4)
	{
		if (g != n)
		{
			for (int i = 0; i < g; i++)
				cout << 'o';
			cout << "--";
			for (int t = g; t < 2 * g; t++)
				cout << '*';
			for (int i = 0; i < n - g; i++)
				cout << "o*";
			cout << endl;
		}
		for (int i = 0; i < g; i++)
			cout << 'o';
		for (int t = g; t < 2 * g; t++)
			cout << '*';
		cout << "--";
		for (int i = 0; i < n - g; i++)
			cout << "o*";
		cout << endl;
		chessman(g - 1);
	}
	else if(g==4)
	{
		for (int i = 0; i < g; i++)
			cout << 'o';
		cout << "--";
		for (int t = g; t < 2 * g; t++)
			cout << '*';
		for (int i = 0; i < n - g; i++)
			cout << "o*";
		cout << endl;
		cout << "oooo****--";
		for (int i = 0; i < n - g; i++)
			cout << "o*";
		cout << endl;
		cout << "ooo--***o*";
		for (int i = 0; i < n - g; i++)
			cout << "o*";
		cout << endl;	
		cout << "ooo*o**--*";
		for (int i = 0; i < n - g; i++)
			cout << "o*";
		cout << endl;	
		cout << "o--*o**oo*";
		for (int i = 0; i < n - g; i++)
			cout << "o*";
		cout << endl;	
		cout << "o*o*o*--o*";
		for (int i = 0; i < n - g; i++)
			cout << "o*";
		cout << endl;
		cout << "--o*o*o*o*";
		for (int i = 0; i < n - g; i++)
			cout << "o*";
		cout << endl;
		return;
	}

}
int main()
{
	freopen("title.in", "r", stdin);
	cin >> n;
	chessman(n);
	return 0;
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值