2266: 蓝桥杯2015年第六届真题-打印大X

解题思路:

注意事项:

参考代码:

#include<stdio.h>

int main()

{

int n, m;

char a[1000][1000] = { ' ' };

scanf("%d%d", &n, &m);

int k = 0;

int j = 0;

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

for (int k = 0; k < m + n - 1; k++)

a[i][k] = '.';

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

{

j = k;

for (; j< n + k; j++)

{

if (i>0)

a[i][j] = '*';

else

a[i][j] = '*';

}

k++;

}

k = 0;

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

{

j = n + m - 2 - k;

for (; j >= m - 1 - k; j--)

{

if (a[i][j] == '*')

continue;

if (i<n + m - 2 - k)

a[i][j] = '*';

else

a[i][j] = '*';

}

k++;

}

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

{

for (int j = 0; j < m + n - 1; j++)

{

printf("%c", a[i][j]);

}

printf("\n");

}

}