Codeforces Round #259 (Div. 2) A-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.

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>
using namespace std;

int main(){
	int n,i,j,k,L,R;
	while(cin>>n){
		for(i=1;i<=n/2;i++){
			L=(n-(2*i-1))/2+1;R=n-(n-(2*i-1))/2;
			for(j=1;j<=n;j++){
				if(j>=L&&j<=R)
				putchar('D');
				else
				putchar('*');
			}
			printf("\n");
		}
		for(i=1;i<=n;i++)
		putchar('D');
		printf("\n");
		
		for(i=n/2+2;i<=n;i++){
			L=i-(n/2)-1;R=n-(i-(n/2)-1);
			for(j=1;j<=n;j++){
				if(j>L&&j<=R)
				putchar('D');
				else
				putchar('*');
			}
			printf("\n");
	   }
	}
	return 0;
}