Codeforces Round 161 (Div. 2)

Solutions for Codeforces Round 161 (Div. 2) (contest 263). 1/3 problems verified against sample I/O. Difficulty range: 800-2000.

5 items

Codeforces Round 161 (Div. 2)

Type: Div. 2 | Problems: 3 | Verified: 1/3 | Rating range: 800-2000 | Time: 5m 38s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Beautiful Matrix	800	implementation	1m 31s	✗
C	Circle of Numbers	2000	brute-force, dfs-and-similar, implementation	1m 10s	✓
D	Cycle in Graph	1800	dfs-and-similar, graphs	2m 57s	✗

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

CF 263A - Beautiful Matrix

We are given a fixed 5 by 5 grid that contains mostly zeros and exactly one cell containing a one. In one move, we are allowed to swap adjacent rows or swap adjacent columns. Each such swap moves the entire row or column by exactly one position.

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

CF 263B - Squares

Codeforces 263B: Squares

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

CF 263C - Circle of Numbers

We are given a hidden cyclic arrangement of the integers from 1 to n placed around a circle. From this arrangement, someone constructed a set of ordered pairs describing connections between values.

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

CF 263D - Cycle in Graph

We are given an undirected graph where every vertex has a very strong local condition: each node is connected to at least $k$ other distinct nodes. From this structure we are asked to extract a simple cycle whose length is not just positive, but at least $k+1$.

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

CF 263E - Rhombus

We are given a rectangular grid of non-negative integers. For every valid center cell (x, y), we define a diamond-shaped region of radius k - 1. The function f(x, y) is the sum of all values inside that rhombus. The task is not to compute every value explicitly and print them.