#include <iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int main()
{
char s[150][150];
int n;
scanf("%d", &n);
/*初始化*/
for(int i = 0; i < 4*n+5; i++)
for(int j = 0; j < 4*n+5; j++)
{
s[i][j] = '.';
}
int core_x = 2*(n+1), core_y = 2*(n+1);
//中间的十字
for(int j = core_y - 2; j <= core_y + 2; j++)
s[core_x][j] = '$';
for(int i = core_x - 2; i <= core_x + 2; i++)
s[i][core_y] = '$';
for(int N = 1; N <= n; N++)
{
for(int j = core_y- 2*N; j <= core_y + 2*N; j++)
{
int x_up = core_x+2 + 2*N;
int x_down = core_x-2 - 2*N;
s[x_up][j] = '$';
s[x_down][j] = '$';
}
for(int j = core_y- 2*N - 2; j <= core_y + 2*N + 2; j++)
{
if(j == core_y-1-(2*(N-1)) || j == core_y+1+(2*(N-1)))
continue;
int x_up = core_x+ 2*N;
int x_down = core_x- 2*N;
s[x_up][j] = '$';
s[x_down][j] = '$';
}
for(int i = core_x - 2*N+1; i <= core_x + 2*N-1; i++)
{
int y_left = core_y - 2*N-2;
int y_right = core_y + 2*N+2;
s[i][y_left] = '$';
s[i][y_right] = '$';
}
s[core_x-2*N-1][core_y-2*N] = '$';
s[core_x-2*N-1][core_y+2*N] = '$';
s[core_x+2*N+1][core_y-2*N] = '$';
s[core_x+2*N+1][core_y+2*N] = '$';
}
//输出
for(int i = 0; i < 4*n+5; i++)
{
for(int j = 0; j < 4*n+5; j++)
{
printf("%c", s[i][j]);
}
printf("\n");
}
return 0;
}
蓝桥杯_嵌套图案
最新推荐文章于 2023-03-22 15:33:40 发布