codeforces 454A Little Pony and Crystal Mine

点击打开链接

A. Little Pony and Crystal Mine

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.

Examples

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<bits/stdc++.h>
using namespace std;
int main()
{
	int n;
	cin>>n;
	char s[105][105];
	memset(s,0,sizeof(s));
	int x=(n+1)/2;
	int p=x-1,q=1;
	int i,j,k;
	for(i=1;i<=x;i++)
	{
		for(j=1;j<=p;j++)
			s[i][j]='*';
		for(k=1;k<=q;k++,j++)
			s[i][j]='D';
		for(;j<=n;j++)
			s[i][j]='*';
		p--;
		q+=2;
	}
	p=1,q=n-2;
	for(i=x+1;i<=n;i++)
	{
		for(j=1;j<=p;j++)
			s[i][j]='*';
		p++;
		for(k=1;k<=q;k++,j++)
			s[i][j]='D';
		q-=2;
		for(;j<=n;j++)
			s[i][j]='*';

	}
	for(i=1;i<=n;i++)
	{
		for(j=1;j<=n;j++)
		{
			cout<<s[i][j];
		}
		cout<<endl;
	}
	return 0;
}