Codeforces Round 955 (Div. 2, with prizes from NEAR!)

Solutions for Codeforces Round 955 (Div. 2, with prizes from NEAR!) (contest 1982). 2/6 problems verified against sample I/O. Difficulty range: 800-2600.

6 items

Codeforces Round 955 (Div. 2, with prizes from NEAR!)

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

Problem	Name	Rating	Tags	Solve Time	Verified
A	Soccer	800	greedy, implementation, math	1m 58s	✓
B	Collatz Conjecture	1200	brute-force, implementation, math	2m 50s	✗
C	Boring Day	1200	binary-search, data-structures, dp	1m 55s	✓
D	Beauty of the mountains	1700	brute-force, data-structures, implementation	2m 5s	✗
E	Number of k-good subarrays	2300	bitmasks, brute-force, combinatorics	3m 13s	✗
F	Sorting Problem Again	2600	binary-search, data-structures, sortings	1m 33s	✗

Practice › Codeforces Solutions › Codeforces Round 955 (Div. 2, with prizes from NEAR!) ›

CF 1982E - Number of k-good subarrays

In this problem, we are given an array consisting of consecutive integers starting from zero. A subarray is considered k-good if every element within it has no more than k ones in its binary representation.

Practice › Codeforces Solutions › Codeforces Round 955 (Div. 2, with prizes from NEAR!) ›

CF 1982F - Sorting Problem Again

We are given an array that changes over time through point updates. After each change, we must answer a structural question about the array: what is the shortest contiguous segment such that, if we sort only that segment, the entire array becomes sorted in non-decreasing order.

Practice › Codeforces Solutions › Codeforces Round 955 (Div. 2, with prizes from NEAR!) ›

CF 1982D - Beauty of the mountains

We are given a grid of numbers representing mountain heights, together with a second grid that splits each cell into one of two groups. One group is marked as snowy-capped, the other is non-snowy.

Practice › Codeforces Solutions › Codeforces Round 955 (Div. 2, with prizes from NEAR!) ›

CF 1982B - Collatz Conjecture

We are asked to simulate a process on a number $x$ using another number $y$ and repeating it $k$ times. Each operation consists of two steps performed in order: first, increment $x$ by one, and second, divide $x$ by $y$ as many times as possible while $x$ remains divisible by…

Practice › Codeforces Solutions › Codeforces Round 955 (Div. 2, with prizes from NEAR!) ›

CF 1982A - Soccer

In this problem, we are given a soccer game scenario where Dima remembers two scores: one just before he got distracted and another when he returned. Each score consists of the goals of the two teams. The game progresses one goal at a time for either team.

Practice › Codeforces Solutions › Codeforces Round 955 (Div. 2, with prizes from NEAR!) ›

CF 1982C - Boring Day

We are asked to simulate a game with a deck of cards arranged in a specific order. Each card has a positive integer on it.