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

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***

学习C语言时候最简单的模拟。。

AC代码：

#include "iostream"#include "cstdio"#include "cstring"#include "algorithm"using namespace std;int main(int argc, char const *argv[]){int n;while(cin >> n) {int a = n /2, b = 1, c = 1;for(int i = 1; i <= n; ++i) {if(a >= 1) {for(int j = 1; j <= a; ++j)printf("*");for(int j = 1; j <= b; ++j)printf("D");for(int j = 1; j <= a; ++j)printf("*");printf("\n");a -= 1;b += 2;}else if(a == 0) {for(int j = 1; j <= n; ++j)printf("D");printf("\n");a -= 1;b -= 2;}else {for(int j = 1; j <= c; ++j)printf("*");for(int j = 1; j <= b; ++j)printf("D");for(int j = 1; j <= c; ++j)printf("*");printf("\n");c += 1;b -= 2;}}}return 0;}