Codeforces Round 259 (Div. 2)

Solutions for Codeforces Round 259 (Div. 2) (contest 454). 2/2 problems verified against sample I/O. Difficulty range: 800-1200.

2 items

Codeforces Round 259 (Div. 2)

Type: Div. 2 | Problems: 2 | Verified: 2/2 | Rating range: 800-1200 | Time: 2m 34s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Little Pony and Crystal Mine	800	implementation	1m 27s	✓
B	Little Pony and Sort by Shift	1200	implementation	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.