Codeforces Round 927 (Div. 3)

Solutions for Codeforces Round 927 (Div. 3) (contest 1932). 3/7 problems verified against sample I/O. Difficulty range: 800-2300.

7 items

Codeforces Round 927 (Div. 3)

Type: Div. 3 | Problems: 7 | Verified: 3/7 | Rating range: 800-2300 | Time: 14m 21s

Problem Name Rating Tags Solve Time Verified
A Thorns and Coins 800 dp, greedy, implementation 1m 20s ✓
B Chaya Calendar 1100 number-theory 1m 36s ✓
C LR-remainders 1400 brute-force, data-structures, implementation 3m 26s ✗
D Card Game 1400 greedy, implementation 2m 22s ✗
E Final Countdown 1600 implementation, math, number-theory 1m 45s ✓
F Feed Cats 1900 data-structures, dp, sortings 1m 56s ✗
G Moving Platforms 2300 graphs, math, number-theory 1m 56s ✗
Practice › Codeforces Solutions › Codeforces Round 927 (Div. 3) ›

CF 1932G - Moving Platforms

We are given a graph of platforms, where each platform has a level between 0 and H-1. Moving from one platform to another is only allowed along a passage and only if the levels match at that moment.
codeforces competitive-programming graphs math number-theory shortest-paths Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 927 (Div. 3) ›

CF 1932F - Feed Cats

We are given a timeline of n steps, and m cats, each defined by the interval [li, ri] during which it appears. At each step, we can feed all cats present, but feeding a cat more than once will cause a loss.
codeforces competitive-programming data-structures dp sortings Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 927 (Div. 3) ›

CF 1932D - Card Game

We are asked to reconstruct rounds of a two-player card game from a shuffled discard pile. The game uses a 32-card deck with four suits (clubs, diamonds, hearts, spades) and ranks from 2 to 9. One suit is declared trump.
codeforces competitive-programming greedy implementation Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 927 (Div. 3) ›

CF 1932C - LR-remainders

We are given an array that shrinks from both ends based on a sequence of instructions. At every step, before we remove anything, we must compute the product of all remaining elements modulo a fixed number $m$.
codeforces competitive-programming brute-force data-structures implementation math two-pointers Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 927 (Div. 3) ›

CF 1932E - Final Countdown

We have a mechanical countdown timer that displays a number with $n$ digits. Each second, the countdown decrements by one. The catch is that the decrement is not instantaneous across all digits.
codeforces competitive-programming implementation math number-theory Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 927 (Div. 3) ›

CF 1932B - Chaya Calendar

The problem describes a sequence of events, called signs, that occur periodically. Each sign i has a period ai, meaning it happens every ai years: in years ai, 2 ai, 3 ai, and so on. The tribe is waiting for the apocalypse, which only happens when the signs occur sequentially.
codeforces competitive-programming number-theory Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 927 (Div. 3) ›

CF 1932A - Thorns and Coins

We are given a one-dimensional path made of cells. Each cell is either empty, contains a coin, or is blocked by thorns. We start at the first cell, which is guaranteed to be empty, and we want to move to the right as far as possible while collecting coins.
codeforces competitive-programming dp greedy implementation Jun 8, 2026