Algorithm
A. Little Pony and Crystal Mine
time limit per test
1 secondmemory limit per test
256 megabytesProblem link- https://codeforces.com/problemset/problem/454/A
input
standard inputoutput
standard outputTwilight 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
Copy
3
output
Copy
*D*
DDD
*D*
input
Copy
5
output
Copy
**D**
*DDD*
DDDDD
*DDD*
**D**
input
Copy
7
output
Copy
***D***
**DDD**
*DDDDD*
DDDDDDD
*DDDDD*
**DDD**
***D***
Code Examples
#1 Code Example with C++ Programming
Code -
C++ Programming
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, space, ds;
cin >> n;
space = n / 2;
for(int i = 0; i < n; i++) {
ds = n - (space * 2);
for(int j = 0; j < space; j++) cout << '*';
for(int j = 0; j < ds; j++) cout << 'D';
for(int j = 0; j < space; j++) cout << '*';
cout << endl;
if(i < n / 2) space--;
else space++;
}
return 0;
}Input
3
Output
*D*
DDD
*D*
DDD
*D*
Demonstration
Codeforces Solution-Little Pony and Crystal Mine-Solution in C, C++, Java, Python