题目链接：https://codeforces.com/contest/454/problem/A
A. Little Pony and Crystal Mine
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard 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 <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;
int main(){
	int n=0;
	scanf("%d",&n);
	int l=n/2+1,r=n/2-1;
	for(int i=0;i<n;i++){
		if(i<=n/2){
			l--;
			r++;
		}
		else{
			l++;
			r--;
		}
		for(int j=0;j<l;j++)
			printf("*");
		for(int j=l;j<=r;j++)
			printf("D");
		for(int j=r+1;j<n;j++)
			printf("*");
		printf("\n");
	}
	return 0;
}