编写题解 1115: DNA

解题思路:

注意事项:

参考代码:

#include<stdio.h>

int main()

{

int n,a[15], b[15], num[780][39];

while (scanf("%d", &n) == 1)

{

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

{

scanf("%d %d", &a[i], &b[i]);

}

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

{

int A = a[i], B = b[i];

int j = 0, k = A - 1,h=0;

while (h<(A*B-B+1))

{

while (j != k)

{

num[h][j] = 1;

num[h][k] = 1;

h++;

j++;

k--;

}

while(k!=A-1)

{

num[h][j] = 1;

num[h][k] = 1;

h++;

j--;

k++;

}

}

j = 0;

k = 0;

while (1)

{

k = 0;

while (k < A)

{

if (num[j][k] == 1)

{

printf("X");

num[j][k] =0;

}

else

printf(" ");

k++;

}

printf("\n");

j++;

if (j == (A * B - B + 1) && k == A)

break;

}

printf("\n");

}

}

}