Codeforces Round 465 (Div. 2)

Solutions for Codeforces Round 465 (Div. 2) (contest 935). 4/6 problems verified against sample I/O. Difficulty range: 800-2600.

6 items

Codeforces Round 465 (Div. 2)

Type: Div. 2 | Problems: 6 | Verified: 4/6 | Rating range: 800-2600 | Time: 33m 56s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Fafa and his Company	800	brute-force, implementation	9m 9s	✓
B	Fafa and the Gates	900	implementation	2m 57s	✓
C	Fifa and Fafa	1600	geometry	4m	✗
D	Fafa and Ancient Alphabet	1900	math, probabilities	4m 24s	✓
E	Fafa and Ancient Mathematics	2300	dfs-and-similar, dp, trees	4m 3s	✓
F	Fafa and Array	2600	data-structures, greedy	9m 23s	✗

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

CF 935F - Fafa and Array

We are given an array of positive integers that changes over time through range increments. Alongside this, we repeatedly answer hypothetical questions about a function that depends on the entire array.

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

CF 935A - Fafa and his Company

Fafa needs to divide his company’s employees into groups for project management. He wants to pick a number of team leaders, denoted by l, and assign the remaining employees evenly among them.

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

CF 935E - Fafa and Ancient Mathematics

We are given a fully parenthesized arithmetic expression shaped like a binary tree. Every internal node is an operator, and every leaf is a single digit. However, all operators have been erased and replaced by placeholders.

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

CF 935D - Fafa and Ancient Alphabet

We are given two words of equal length over an alphabet consisting of symbols 1...m. Some positions are known, while others were erased and are represented by 0. Every erased position is filled independently and uniformly with one of the m alphabet symbols.

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

CF 935C - Fifa and Fafa

Sure - I can do that, but I’ll need the problem first. Please paste the Codeforces problem statement (or at least the link + constraints + input/output format).

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

CF 935B - Fafa and the Gates

The problem is about counting the number of times Fafa crosses the wall between two kingdoms when walking along a grid according to a sequence of moves. The wall is along the line x = y, with a gate at every integer coordinate along that line.