#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;
#define MAX 3010
char maps[MAX][MAX];
void print(int n, int x, int y)
{
if (n == 1)
{
maps[x][y + 1] = maps[x + 1][y] = maps[x + 1][y + 2] = 'O';
return;
}
else
{
int m = pow(2, n - 1); //选择上次分形度(n-1) m为高, 2*m为宽;
print(n - 1, x, y + m);
print(n - 1, x + m, y);
print(n - 1, x + m, y + 2 * m);
}
}
int main()
{
int t;
scanf("%d", &t);
for (int i = 0; i<t; i++)
{
i
分形三角形
最新推荐文章于 2023-07-04 13:17:43 发布