Codeforces Round 569 (Div. 2)

Solutions for Codeforces Round 569 (Div. 2) (contest 1180). 1/2 problems verified against sample I/O. Difficulty range: 800-1500.

2 items

Codeforces Round 569 (Div. 2)

Type: Div. 2 | Problems: 2 | Verified: 1/2 | Rating range: 800-1500 | Time: 11m 59s

Problem Name Rating Tags Solve Time Verified
A Alex and a Rhombus 800 dp, implementation, math 59s ✓
B Nick and Array 1500 greedy, implementation 11m ✗
Practice › Codeforces Solutions › Codeforces Round 569 (Div. 2) ›

CF 1180B - Nick and Array

We are given an array of integers, and for each position we are allowed to repeatedly apply a transformation that replaces a value $x$ with $-x-1$.
codeforces competitive-programming greedy implementation Jun 13, 2026
Practice › Codeforces Solutions › Codeforces Round 569 (Div. 2) ›

CF 1180A - Alex and a Rhombus

We are given a shape that grows on a grid starting from a single cell. At the first stage there is exactly one cell. At every next stage, the shape expands by attaching every grid cell that shares an edge with any cell already in the shape.
codeforces competitive-programming dp implementation math Jun 12, 2026