Codeforces Round 259 (Div. 2)

2 problems from Codeforces Round 259 (Div. 2) (contest 454), difficulty 800-1200. 2/2 solutions verified against sample I/O.

2 items

Codeforces Round 259 (Div. 2)

Div. 2 | 2 problems | 2/2 verified | Difficulty 800-1200 | 2m 34s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Little Pony and Crystal Mine	800	implementation	16,119	1m 27s	✓
B	Little Pony and Sort by Shift	1200	implementation	19,164	1m 7s	✓

Practice › Codeforces Solutions › Codeforces Round 259 (Div. 2) ›

CF 454A - Little Pony and Crystal Mine

We need to print an odd-sized square grid that contains a diamond shape. Every cell belonging to the diamond is represented by the character D, and every other cell is represented by . The input contains a single odd integer n.

Practice › Codeforces Solutions › Codeforces Round 259 (Div. 2) ›

CF 454B - Little Pony and Sort by Shift

We are given a sequence of integers arranged in a line, and our goal is to sort them in non-decreasing order by repeatedly performing a single allowed operation: moving the last element of the sequence to the front.