全MLE,0pts求助%%%
查看原帖
全MLE,0pts求助%%%
1082484
封禁用户楼主2024/10/8 16:20

code:

#include<bits/stdc++.h>
using namespace std;
char c[2050][2050];
int n;
void f(int x, int y, int z)
{
	if (n == 1)
	{
		c[x][y + 1] = '/';
		c[x + 1][y] = '/';
		c[x][y + 2] = '\\';
		c[x + 1][y + 3] = '\\';
		c[x + 1][y + 1] = '_';
		c[x + 1][y + 2] = '_';
		return;
	}
	int distance = pow(2, n);
	f(x, y + distance / 2, n - 1);
	f(x + distance / 2, y, n - 1);
	f(x + distance / 2, y + distance, n - 1);
}
int main()
{
	cin >> n;
	memset(c, ' ', sizeof(c));
	f(0, 0, n);
	int distance = pow(2, n);
	for (int i = 0; i < distance; i++)
	{
		for (int j = 0; j < distance * 2; j++)
		{
			cout << c[i][j];
		}
		cout << endl;
	}
	return 0;
} 
2024/10/8 16:20
加载中...