The Andover Computing Open (TACO) 2022

14 problems from The Andover Computing Open (TACO) 2022 (contest 104381), difficulty -. 6/14 solutions verified against sample I/O.

14 items

The Andover Computing Open (TACO) 2022

Special | 14 problems | 6/14 verified | Difficulty - | 24m 50s

#	Problem	Time	✓
A	Battleship	1m 4s	✓
B	Knishop	1m	✓
C	Bashy Math	2m 23s	✓
D	Star Trek Wall	51s	✓
E	Password Guessing	1m 25s
F	Hello World!	1m	✓
G	Anti-Gravity Boots	3m 37s
H	Grocery Shopping	1m 18s
I	Line up	1m 28s
J	Rash Cloyale	56s	✓
K	Hopscotch (Easy Version)	1m 27s
L	Walking to School	1m 27s
M	Friendship	3m 3s
N	Hopscotch	3m 51s

Practice › Codeforces Solutions › The Andover Computing Open (TACO) 2022 ›

CF 104381N - Hopscotch

This is no longer a parsing or I/O issue. The program runs and produces a value (29), but it is mathematically wrong. Let’s trace what the structure of the input implies: The first line strongly suggests: - N = 2, M = 3 Then we have multiple rows of paired data.

Practice › Codeforces Solutions › The Andover Computing Open (TACO) 2022 ›

CF 104381M - Friendship

We are given a line of people indexed from 1 to n. Each person i defines a range of other people they “know” based on their position: they know everyone whose index lies between i minus ai and i plus bi, inclusive.

Practice › Codeforces Solutions › The Andover Computing Open (TACO) 2022 ›

CF 104381L - Walking to School

We are given a directed or undirected graph of crossings connected by paths. Each path has a snow depth value, and Michael starts at crossing 1 and wants to reach a target crossing T. The twist is that his walking cost is not additive in the usual sense.

Practice › Codeforces Solutions › The Andover Computing Open (TACO) 2022 ›

CF 104381G - Anti-Gravity Boots

The failure here is not coming from the mathematical idea, but from execution flow. For the input: the correct output is 5, which matches the standard “count ordered pairs (i, j) where a[i] is divisible by a[j]”.

Practice › Codeforces Solutions › The Andover Computing Open (TACO) 2022 ›

CF 104381K - Hopscotch (Easy Version)

We are given two parallel rows of numbered tiles, each row containing $n$ positions. At every index $i$, the left row has a value $ai$ and the right row has a value $bi$.

Practice › Codeforces Solutions › The Andover Computing Open (TACO) 2022 ›

CF 104381J - Rash Cloyale

We are given two equal-sized groups of players, each containing $n$ people. Every player has a rating. The organizers will split players into two fixed groups A and B, but the pairing is flexible: each person in A must be matched with exactly one person in B, forming $n$ 2v2…

Practice › Codeforces Solutions › The Andover Computing Open (TACO) 2022 ›

CF 104381I - Line up

We are given a sequence of length $n$, and we want to decide whether it could have been produced from some hidden permutation of $1$ to $n$.

Practice › Codeforces Solutions › The Andover Computing Open (TACO) 2022 ›

CF 104381H - Grocery Shopping

We are asked to find the smallest integer that Michael can pay such that it is at least a given value $N$, but with a digit constraint on the payment itself. The constraint is purely about the decimal representation of the number we choose.

Practice › Codeforces Solutions › The Andover Computing Open (TACO) 2022 ›

CF 104381F - Hello World!

We are given a small array of integers, and we want to count how many ordered triples of indices $(x, y, z)$ satisfy the condition that the product of the two chosen elements equals a third element in the array.

Practice › Codeforces Solutions › The Andover Computing Open (TACO) 2022 ›

CF 104381E - Password Guessing

We are tracking a randomized password system that evolves week by week. There is a fixed list of $n+1$ distinct passwords. At the start, in week 1, the system uses the first password in the list. Each week, the password either stays the same or changes.

Practice › Codeforces Solutions › The Andover Computing Open (TACO) 2022 ›

CF 104381C - Bashy Math

We are given a collection of integers and we want to count ordered relationships between indices based on divisibility. For every pair of positions $i$ and $j$, we check whether the value at $i$ is divisible by the value at $j$, while ensuring the two indices are different.

Practice › Codeforces Solutions › The Andover Computing Open (TACO) 2022 ›

CF 104381D - Star Trek Wall

We are given a small set of axis-aligned rectangular posters placed on a fixed 20 by 20 grid that represents a wall. Each poster covers every cell inside its rectangle, and multiple posters may overlap.

Practice › Codeforces Solutions › The Andover Computing Open (TACO) 2022 ›

CF 104381A - Battleship

We are given a square game board of size $n times n$, where each cell is either ocean or a ship. A single query is made: a pair of coordinates $(r, c)$ representing a guessed cell on this board. The task is to determine what exists at that exact position.

Practice › Codeforces Solutions › The Andover Computing Open (TACO) 2022 ›

CF 104381B - Knishop

We are given two points on an infinite grid with integer coordinates. A piece starts at the first point and needs to reach the second point. In one move, the piece can behave in two different ways.