Bay Area Programming Contest 2026 Novice Division

11 problems from Bay Area Programming Contest 2026 Novice Division (contest 106403), difficulty -. 7/11 solutions verified against sample I/O.

11 items

Bay Area Programming Contest 2026 Novice Division

Special | 11 problems | 7/11 verified | Difficulty - | 6m 45s

#	Problem	Time	✓
A	Luxury	40s	✓
B	Clock Creation	39s	✓
C	Sandwiched Jenga	26s
D	Power Up	41s	✓
E	Transition	25s
F	Volcanic Islands	50s	✓
G	Balancing	26s
H	Alien Attack (Easy Version)	39s	✓
I	Toggling Flips	58s	✓
J	Best Friends	25s
K	Alien Attack	36s	✓

Practice › Codeforces Solutions › Bay Area Programming Contest 2026 Novice Division ›

CF 106403I - Toggling Flips

We have a binary string of tiles. The tiles are placed on a line, and the operation is controlled by a fixed distance k. Standing at some tile p, we can flip tile p together with tile p + k, as long as that second tile exists.

Practice › Codeforces Solutions › Bay Area Programming Contest 2026 Novice Division ›

CF 106403K - Alien Attack

We have a tree of cities. A meteor can hit a city once at some time with some initial energy. After the hit, that city's contribution decreases by one every second.

Practice › Codeforces Solutions › Bay Area Programming Contest 2026 Novice Division ›

CF 106403J - Best Friends

Sure-please paste the full problem statement (or link/text). If it’s a Codeforces problem, include as much as you can: input/output format, constraints, and sample tests.

Practice › Codeforces Solutions › Bay Area Programming Contest 2026 Novice Division ›

CF 106403H - Alien Attack (Easy Version)

We have a country represented as a tree. Each city can receive at most one meteor during the whole process. When a meteor lands on a city at time t0 with energy val, that city starts contributing a value that decreases by exactly 1 every second.

Practice › Codeforces Solutions › Bay Area Programming Contest 2026 Novice Division ›

CF 106403F - Volcanic Islands

The task describes a tree of islands connected by bridges, where each island can host a single “event” that starts at a specific time and then gradually weakens over time.

Practice › Codeforces Solutions › Bay Area Programming Contest 2026 Novice Division ›

CF 106403G - Balancing

and a correct Python implementation.

Practice › Codeforces Solutions › Bay Area Programming Contest 2026 Novice Division ›

CF 106403D - Power Up

The problem asks us to answer many independent checks about a collection of power values. We have a set of distinct numbers.

Practice › Codeforces Solutions › Bay Area Programming Contest 2026 Novice Division ›

CF 106403E - Transition

I can write the full editorial, but the actual problem statement for Codeforces 106403E - Transition is missing from your prompt. The section under “Problem Statement” is empty, and I could not reliably identify the exact problem from the ID alone.

Practice › Codeforces Solutions › Bay Area Programming Contest 2026 Novice Division ›

CF 106403A - Luxury

We are given several independent integers. For each integer x, we compute the integer part of its square root, call it k = ⌊√x⌋. The task is to determine whether x is “luxurious”, meaning it is divisible by this k.

Practice › Codeforces Solutions › Bay Area Programming Contest 2026 Novice Division ›

CF 106403B - Clock Creation

We are designing a clock made from several independent gears. A gear with x teeth completes a full cycle every x seconds because it moves one tooth per second.

Practice › Codeforces Solutions › Bay Area Programming Contest 2026 Novice Division ›

CF 106403C - Sandwiched Jenga

Sure. Please provide the Codeforces problem statement (or link/name), constraints, and any sample input/output if available.