Codeforces Round 264 (Div. 2)

Solutions for Codeforces Round 264 (Div. 2) (contest 463). 5/5 problems verified against sample I/O. Difficulty range: 1100-2100.

5 items

Codeforces Round 264 (Div. 2)

Type: Div. 2 | Problems: 5 | Verified: 5/5 | Rating range: 1100-2100 | Time: 4m 50s

Problem Name Rating Tags Solve Time Verified
A Caisa and Sugar 1200 brute-force, implementation 1m ✓
B Caisa and Pylons 1100 brute-force, implementation, math 59s ✓
C Gargari and Bishops 1900 greedy, hashing, implementation 1m 6s ✓
D Gargari and Permutations 1900 dfs-and-similar, dp, graphs 58s ✓
E Caisa and Tree 2100 brute-force, dfs-and-similar, math 47s ✓
Practice › Codeforces Solutions › Codeforces Round 264 (Div. 2) ›

CF 463A - Caisa and Sugar

We are given a fixed amount of money expressed in dollars, and a list of sugar options in a supermarket. Each option has a price written as dollars and cents.
codeforces competitive-programming brute-force implementation May 30, 2026
Practice › Codeforces Solutions › Codeforces Round 264 (Div. 2) ›

CF 463B - Caisa and Pylons

We are given a sequence of pylons arranged in a line, starting from position 0 up to position n. The first pylon is fixed at height 0, and every other pylon has a given height.
codeforces competitive-programming brute-force implementation math May 30, 2026
Practice › Codeforces Solutions › Codeforces Round 264 (Div. 2) ›

CF 463C - Gargari and Bishops

We have an $n times n$ chessboard, and each cell has a non-negative integer representing money. The goal is to place exactly two bishops such that no cell is attacked by both bishops, and we maximize the total money collected from all cells that are attacked by at least one…
codeforces competitive-programming greedy hashing implementation May 30, 2026
Practice › Codeforces Solutions › Codeforces Round 264 (Div. 2) ›

CF 463D - Gargari and Permutations

We are given k permutations of the numbers from 1 to n. A permutation is simply a rearrangement of these numbers. Our goal is to find the length of the longest sequence of numbers that appears in the same relative order in all k permutations.
codeforces competitive-programming dfs-and-similar dp graphs implementation May 30, 2026
Practice › Codeforces Solutions › Codeforces Round 264 (Div. 2) ›

CF 463E - Caisa and Tree

We are given a rooted tree with n nodes, each node assigned a positive integer value. Node 1 is the root. Queries ask either to find the deepest ancestor of a node v whose value shares a non-trivial greatest common divisor with v, or to update the value of a node.
codeforces competitive-programming brute-force dfs-and-similar math number-theory trees May 30, 2026