The Andover Computing Open (TACO) 2023

18 problems from The Andover Computing Open (TACO) 2023 (contest 104380), difficulty -. 12/18 solutions verified against sample I/O.

18 items

The Andover Computing Open (TACO) 2023

Special | 18 problems | 12/18 verified | Difficulty - | 24m 43s

# Problem Rating Tags Accepted Time ✓
A 01 (Easy Version) 57s ✓
B Mine Sweeper 1m 33s
C Number Machine 1m 6s ✓
D Primewords Revisit 1m 1s ✓
E Weird Knight 1m 14s ✓
F Double-Ended Queue 1m 21s ✓
G Social Network 2m 11s
H 01 (Hard Version) 1m 27s ✓
I Bad Grades 53s ✓
J No 7 1m 2s ✓
K glimmerypond 1m 15s
L Equation 1m 16s ✓
M Tower 1m 40s ✓
N Robot 1m 29s
O Rabbit Jump 1m 27s
P Dungeon 1m 42s ✓
Q Deque 2 (Easy Version) 1m 40s ✓
R Deque 2 (Hard Version) 1m 29s
Practice › Codeforces Solutions › The Andover Computing Open (TACO) 2023 ›

CF 104380R - Deque 2 (Hard Version)

We are given a sequence of numbers and we build a deque by processing them in order. For each element, we decide independently whether it is inserted at the front or at the back.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › The Andover Computing Open (TACO) 2023 ›

CF 104380Q - Deque 2 (Easy Version)

We are repeatedly building a sequence of length n by processing the array from left to right. At each step, the current element is inserted either at the front or at the back of an initially empty deque.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › The Andover Computing Open (TACO) 2023 ›

CF 104380P - Dungeon

The dungeon is a straight line, and the knight walks from position 0 to position D without ever turning back. Along this path there are two kinds of encounters: monsters and shops, each placed at fixed positions.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › The Andover Computing Open (TACO) 2023 ›

CF 104380O - Rabbit Jump

We start at the origin in a grid and want to reach a target coordinate $(x, y)$. From any current position, the rabbit has three possible moves: it can move one step right for cost $A$, one step up for cost $B$, or it can scale both coordinates by a factor of two for cost $C$.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › The Andover Computing Open (TACO) 2023 ›

CF 104380N - Robot

We are given a grid representing a maze where some cells are blocked and others are free. A robot starts in the top-left cell and must execute a sequence of moves of fixed length.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › The Andover Computing Open (TACO) 2023 ›

CF 104380M - Tower

Each tower in this problem acts like a light source placed on a number line. A tower at position $ai$ emits a brightness that starts at $pi$ at its own location and then decreases linearly as you move away from it.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › The Andover Computing Open (TACO) 2023 ›

CF 104380L - Equation

We are given a consecutive list of integers starting from 0 up to n. Between every pair of adjacent numbers, we are allowed to insert either a plus or a minus sign, effectively deciding whether each number contributes positively or negatively to a running sum.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › The Andover Computing Open (TACO) 2023 ›

CF 104380K - glimmerypond

We are given a binary grid that represents a pond, where each cell is either water or empty ground. On top of this grid, we consider every possible square region of fixed size $k times k$.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › The Andover Computing Open (TACO) 2023 ›

CF 104380J - No 7

We are given a single positive integer x, and we need to move strictly downward to find the closest smaller integer that avoids a specific digit constraint: none of its decimal digits may be 7.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › The Andover Computing Open (TACO) 2023 ›

CF 104380H - 01 (Hard Version)

We are given a binary string that evolves over time. Two kinds of operations happen: flipping a single character, and answering a query on a substring.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › The Andover Computing Open (TACO) 2023 ›

CF 104380I - Bad Grades

We are given a sequence of exam grades for a student, each grade being an integer between 0 and 100. The task is to produce a cleaned version of this sequence where every grade below 60 is removed, while keeping the relative order of the remaining grades exactly the same as in…
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › The Andover Computing Open (TACO) 2023 ›

CF 104380G - Social Network

We are given a set of people labeled from 1 to $n$, but $n$ can be extremely large, so we cannot afford to explicitly build any structure over all individuals.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › The Andover Computing Open (TACO) 2023 ›

CF 104380B - Mine Sweeper

We are given a rectangular grid where every cell contains a number describing how many mines are present in a specific neighborhood around that cell.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › The Andover Computing Open (TACO) 2023 ›

CF 104380E - Weird Knight

We are given a generalized knight piece that moves on an infinite integer grid. From any cell $(x,y)$, it can jump to eight symmetric positions obtained by permuting and flipping the vectors $(p,q)$ and $(q,p)$ with independent sign changes.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › The Andover Computing Open (TACO) 2023 ›

CF 104380F - Double-Ended Queue

We are given a sequence of numbers that must be inserted one by one into a deque. Each number can be placed either at the front or at the back, and once placed, its position is fixed.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › The Andover Computing Open (TACO) 2023 ›

CF 104380D - Primewords Revisit

We are constructing a digit string of length $n$, where each position can independently take a value from 0 to 9.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › The Andover Computing Open (TACO) 2023 ›

CF 104380C - Number Machine

We start with a machine that stores a single integer, initially equal to 1. Two operations are allowed. One operation multiplies the current value by 3 and then adds 2, and the other operation simply increases the value by 1.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › The Andover Computing Open (TACO) 2023 ›

CF 104380A - 01 (Easy Version)

We are given a binary string consisting only of characters 0 and 1. We are allowed to repeatedly find any adjacent pattern "01" and remove it completely from the string, closing the gap left by the deletion.
codeforces competitive-programming Jul 1, 2026