DNA-题解（C++代码）

解题思路:

注意事项:

参考代码:

#define _CRT_SECURE_NO_WARNINGS

#include <iostream>

using namespace std;

void print(int a, int b) {

//动态生成一个对应的矩阵

int** r = new int*[a];

for (int i = 0; i < a; i++)

r[i] = new int[a];

for (int i = 0; i < a; i++)

{

for (int j = 0; j < a; j++)

{

if (i==j || (i + j) == (a - 1)) r[i][j] = 1;

else r[i][j] = 0;

}

}

for (int i = b; i < a; i++)

{

for (int j = 0; j < a; j++)

{

//1:输出X 0:输出空格

if (r[i][j]==1) cout << "X";

else cout << " ";

}

cout << endl;

}

}

int t[30];//因为题目最多15，所以用30存储所需数据

int main() {

int n = 0;

cin >> n;

getchar();

int c = 0;

while (scanf("%d", &t[c++]) != EOF);

int test = 0;

while (test <= c)

{

int a = t[test], b = t[test + 1];

int flag = 0;

for (int i = 0; i < b; i++)

{

if (!flag)

{

print(a, flag);

flag = 1;

}

else print(a, flag);

}

cout << endl;

test += 2;

}

//system("pause");

return 0;

}