问题描述
小明为某机构设计了一个十字型的徽标(并非红十字会啊),如下所示:
..$$$$$$$$$$$$$..
..$...........$..
$$$.$$$$$$$$$.$$$
..$...........$..
$$$.$$$$$$$$$.$$$
$...$.......$...$
$.$$$.$$$$$.$$$.$
$.$...$...$...$.$
$.$.$$$.$.$$$.$.$
$.$.$...$...$.$.$
$.$.$.$$$$$.$.$.$
$.$.$...$...$.$.$
$.$.$$$.$.$$$.$.$
$.$...$...$...$.$
$.$$$.$$$$$.$$$.$
$...$.......$...$
$$$.$$$$$$$$$.$$$
..$...........$..
..$$$$$$$$$$$$$..
$.$$$.$$$$$.$$$.$
$.$...$...$...$.$
$.$.$$$.$.$$$.$.$
$.$.$...$...$.$.$
$.$.$.$$$$$.$.$.$
$.$.$...$...$.$.$
$.$.$$$.$.$$$.$.$
$.$...$...$...$.$
$.$$$.$$$$$.$$$.$
$...$.......$...$
$$$.$$$$$$$$$.$$$
..$...........$..
..$$$$$$$$$$$$$..
对方同时也需要在电脑dos窗口中以字符的形式输出该标志,并能任意控制层数。
输入格式
一个正整数 n (n<30) 表示要求打印图形的层数。
输出格式
对应包围层数的该标志。
样例输入1
1
样例输出1
..$$$$$..
..$...$..
$$$.$.$$$
$...$...$
$.$$$$$.$
$...$...$
$$$.$.$$$
..$...$..
..$$$$$..
..$...$..
$$$.$.$$$
$...$...$
$.$$$$$.$
$...$...$
$$$.$.$$$
..$...$..
..$$$$$..
样例输入2
3
样例输出2
..$$$$$$$$$$$$$..
..$...........$..
$$$.$$$$$$$$$.$$$
$...$.......$...$
$.$$$.$$$$$.$$$.$
$.$...$...$...$.$
$.$.$$$.$.$$$.$.$
$.$.$...$...$.$.$
$.$.$.$$$$$.$.$.$
$.$.$...$...$.$.$
$.$.$$$.$.$$$.$.$
$.$...$...$...$.$
$.$$$.$$$$$.$$$.$
$...$.......$...$
$$$.$$$$$$$$$.$$$
..$...........$..
..$$$$$$$$$$$$$..
..$...........$..
$$$.$$$$$$$$$.$$$
$...$.......$...$
$.$$$.$$$$$.$$$.$
$.$...$...$...$.$
$.$.$$$.$.$$$.$.$
$.$.$...$...$.$.$
$.$.$.$$$$$.$.$.$
$.$.$...$...$.$.$
$.$.$$$.$.$$$.$.$
$.$...$...$...$.$
$.$$$.$$$$$.$$$.$
$...$.......$...$
$$$.$$$$$$$$$.$$$
..$...........$..
..$$$$$$$$$$$$$..
import java.util.Scanner;
public class Main{
public static void main(String[] args) {
Scanner asd = new Scanner(System.in);
int n = asd.nextInt();
char[][] b = new char[5][9];
for (int i = 0; i < b.length; i++)
for (int j = 0; j < b[i].length; j++)
b[i][j] = '.';
for (int i = 2; i < 7; i++)
b[0][i] = '$';
for (int i = 0; i < 9; i++) {
b[2][i] = '$';
b[4][i] = '$';
}
b[2][3] = b[2][5] = b[4][1] = b[4][7] = '.';
b[3][0] = b[3][4] = b[3][8] = b[1][2] = b[1][6] = '$';
char[][] a = new char[2 * n + 3][4 * n + 5];
for (int i = 2 * n - 2; i < 2 * n + 3; i++)
for (int j = 2 * n - 2; j < 2 * n + 7; j++)
a[i][j] = b[i - 2 * n + 2][j - 2 * n + 2];
for (int k = 2; k <= n; k++) {
int m = 2 * (n - k);
int x = 2 * (n + k);
for (int i = 2 * (n - k); i < x+5; i++) {
a[m][i] = '$';
a[m + 1][i] = '.';
}
a[m][m] = a[m][m + 1] = a[m][x + 4] = a[m][x + 3] = '.';
a[m + 1][m + 2] = a[m + 1][x + 2] = '$';
a[m + 2][m] = a[m + 2][m + 1] = a[m + 2][m + 2] = '$';
a[m + 2][x + 2] = a[m + 2][x + 3] = a[m + 2][x + 4] = '$';
for (int i = 0; i < 2 * k; i++) {
a[m + i + 3][m] = a[m + i + 3][x + 4] = '$';
a[m + i + 3][m + 1] = a[m + i + 3][x + 3] = '.';
}
}
for (int i = 0; i < a.length; i++) {
for (int j = 0; j < a[i].length; j++)
System.out.print(a[i][j]);
System.out.println();
}
for (int i = a.length - 2; i >= 0; i--) {
for (int j = a[i].length - 1; j >= 0; j--)
System.out.print(a[i][j]);
System.out.println();
}
}
}