CodeCraft-21 and Codeforces Round 711 (Div. 2)

Solutions for CodeCraft-21 and Codeforces Round 711 (Div. 2) (contest 1498). 2/6 problems verified against sample I/O. Difficulty range: 800-2500.

6 items

CodeCraft-21 and Codeforces Round 711 (Div. 2)

Type: Div. 2 | Problems: 6 | Verified: 2/6 | Rating range: 800-2500 | Time: 19m 25s

Problem Name Rating Tags Solve Time Verified
A GCD Sum 800 brute-force, math 2m 3s ✓
B Box Fitting 1300 binary-search, bitmasks, data-structures 2m 44s ✗
C Planar Reflections 1600 brute-force, data-structures, dp 2m 17s ✓
D Bananas in a Microwave 2200 dfs-and-similar, dp, graphs 4m 11s ✗
E Two Houses 2200 brute-force, graphs, greedy 2m 40s ✗
F Christmas Game 2500 bitmasks, data-structures, dfs-and-similar 5m 30s ✗
Practice › Codeforces Solutions › CodeCraft-21 and Codeforces Round 711 (Div. 2) ›

CF 1498F - Christmas Game

We are asked to analyze a two-player game on a tree. Each node of the tree contains a certain number of presents, and players take turns moving presents from nodes to their $k$-th ancestor. The player who cannot make a move loses.
codeforces competitive-programming bitmasks data-structures dfs-and-similar dp games math trees Jun 10, 2026
Practice › Codeforces Solutions › CodeCraft-21 and Codeforces Round 711 (Div. 2) ›

CF 1498D - Bananas in a Microwave

We are simulating a process that builds up a number starting from zero. At each of $n$ time steps, we are given an operation that can be partially repeated. Each operation comes with a limit $yi$, and we choose how many times to apply it, from zero up to that limit.
codeforces competitive-programming dfs-and-similar dp graphs implementation Jun 10, 2026
Practice › Codeforces Solutions › CodeCraft-21 and Codeforces Round 711 (Div. 2) ›

CF 1498E - Two Houses

We are given a city with $n$ houses, where for each pair of houses there is exactly one directed road connecting them, either from the first to the second or vice versa. The input does not specify the directions of these roads.
codeforces competitive-programming brute-force graphs greedy interactive sortings Jun 10, 2026
Practice › Codeforces Solutions › CodeCraft-21 and Codeforces Round 711 (Div. 2) ›

CF 1498B - Box Fitting

I can't reliably diagnose this one from the sample alone because the sample input/output pair does not identify the problem.
codeforces competitive-programming binary-search bitmasks data-structures greedy Jun 10, 2026
Practice › Codeforces Solutions › CodeCraft-21 and Codeforces Round 711 (Div. 2) ›

CF 1498C - Planar Reflections

We have n planes arranged in a line. A particle starts outside the left side and moves to the right with decay age k. Whenever a particle crosses a plane, it always continues moving in the same direction.
codeforces competitive-programming brute-force data-structures dp Jun 10, 2026
Practice › Codeforces Solutions › CodeCraft-21 and Codeforces Round 711 (Div. 2) ›

CF 1498A - GCD Sum

The problem asks us to find, for a given integer $n$, the smallest integer $x$ greater than or equal to $n$ such that the greatest common divisor of $x$ and the sum of its digits is greater than one.
codeforces competitive-programming brute-force math Jun 10, 2026