time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
Twilight Sparkle once got a crystal from the Crystal Mine. A crystal of size n (n is odd; n > 1) is an n × n matrix with a diamond inscribed into it.
You are given an odd integer n. You need to draw a crystal of size n. The diamond cells of the matrix should be represented by character "D". All other cells of the matrix should be represented by character "*". Look at the examples to understand what you need to draw.
Input
The only line contains an integer n (3 ≤ n ≤ 101; n is odd).
Output
Output a crystal of size n.
Sample test(s)
Input
3
Output
*D*
DDD
*D*
Input
5
Output
**D**
*DDD*
DDDDD
*DDD*
**D**
Input
7
Output
***D***
**DDD**
*DDDDD*
DDDDDDD
*DDDDD*
**DDD**
***D***
题解:
模拟。
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<algorithm>
using namespace std;
int n,m;
int main()
{
scanf("%d",&n);
m=(n+1)/2;
int i,j;
for (i=1;i<=m;i++)
{for (j=1;j<=m-i;j++) printf("*");
for (j=1;j<=2*i-1;j++) printf("D");
for (j=1;j<=m-i;j++)printf("*");
printf("\n");
}
for (int i=m-1;i>=1;i--)
{for(j=1;j<=m-i;j++) printf("*");
for(j=1;j<=2*i-1;j++) printf("D");
for(j=1;j<=m-i;j++) printf("*");
printf("\n");
}
return 0;
}