2025 Argentinian Programming Tournament (TAP)

14 problems from 2025 Argentinian Programming Tournament (TAP) (contest 106054), difficulty -. 14/14 solutions verified against sample I/O.

14 items

2025 Argentinian Programming Tournament (TAP)

Special | 14 problems | 14/14 verified | Difficulty - | 10m 54s

# Problem Rating Tags Accepted Time ✓
A Artifact to print 50s ✓
B Block sum array 58s ✓
C Circularly 54s ✓
D Day of rain 47s ✓
E Execution 49s ✓
F Feeding the goat 49s ✓
G Going to the kiosk 34s ✓
H Hidden divisor 48s ✓
I In\u00e9s and her compitas 54s ✓
J Jaimito's blocks 38s ✓
K Kuantum 40s ✓
L Lakes 46s ✓
M March and Conquer 41s ✓
N Nothofagus antarctica 46s ✓
Practice › Codeforces Solutions › 2025 Argentinian Programming Tournament (TAP) ›

CF 106054B - Block sum array

We are given a target array of block sums. Each value in this array represents the sum of a contiguous segment of some hidden array $A$, where every segment has fixed length $K$.
codeforces competitive-programming Jun 21, 2026
Practice › Codeforces Solutions › 2025 Argentinian Programming Tournament (TAP) ›

CF 106054D - Day of rain

Each round of the game is fully described: we know exactly which two cards were played and in which order. What we do not know is which suit was chosen as trump, and that single missing piece affects how every round is evaluated.
codeforces competitive-programming Jun 21, 2026
Practice › Codeforces Solutions › 2025 Argentinian Programming Tournament (TAP) ›

CF 106054M - March and Conquer

We are given a graph of cities connected by undirected roads, all of equal length. Marco starts at city 1 and must reach city 2. Each “day” he walks along a simple walk in the graph consisting of at least 1 and at most K edges, and then stops.
codeforces competitive-programming Jun 21, 2026
Practice › Codeforces Solutions › 2025 Argentinian Programming Tournament (TAP) ›

CF 106054L - Lakes

We are given a 1 × N strip where each cell is either water or land. Some water cells already exist, and land cells can optionally be excavated into water by paying a cost per cell. Once we decide what becomes water, we try to place boats.
codeforces competitive-programming Jun 21, 2026
Practice › Codeforces Solutions › 2025 Argentinian Programming Tournament (TAP) ›

CF 106054K - Kuantum

We are given a tree of $N$ processing units. Each node has an integer label called its frequency. The structure is static, but we must answer many independent queries about communication between two nodes $X$ and $Y$. A message does not travel in a single simple path.
codeforces competitive-programming Jun 21, 2026
Practice › Codeforces Solutions › 2025 Argentinian Programming Tournament (TAP) ›

CF 106054J - Jaimito's blocks

We are given two configurations of stacked blocks distributed across $T$ towers. Each tower is essentially a stack, and every block has a weight.
codeforces competitive-programming Jun 21, 2026
Practice › Codeforces Solutions › 2025 Argentinian Programming Tournament (TAP) ›

CF 106054G - Going to the kiosk

We are modeling a very small payment system. A customer wants to buy an item priced at $A$ pesos. He pays with a single bill worth $B$ pesos, so the kiosk must return exactly $B - A$ pesos in change.
codeforces competitive-programming Jun 21, 2026
Practice › Codeforces Solutions › 2025 Argentinian Programming Tournament (TAP) ›

CF 106054E - Execution

We are given a tree rooted at node 1. Every node except the root starts with some number of soldiers placed on it. Time evolves in discrete turns.
codeforces competitive-programming Jun 21, 2026
Practice › Codeforces Solutions › 2025 Argentinian Programming Tournament (TAP) ›

CF 106054H - Hidden divisor

We are given a multiset of divisors of an unknown integer $X$, but one divisor is missing. In total, $X$ has exactly $N+1$ positive divisors, and we are given $N$ of them.
codeforces competitive-programming Jun 20, 2026
Practice › Codeforces Solutions › 2025 Argentinian Programming Tournament (TAP) ›

CF 106054C - Circularly

We are given a permutation of length $N$, meaning it contains each number from 1 to $N$ exactly once. From this permutation, we define a transformation called “taking a semi-fixed point”: an index $x$ is counted if applying the permutation twice brings us back to $x$…
codeforces competitive-programming Jun 20, 2026
Practice › Codeforces Solutions › 2025 Argentinian Programming Tournament (TAP) ›

CF 106054N - Nothofagus antarctica

We are given a set of points on a 2D grid, each point representing the position of a tree that must be protected. The government wants to build a fence that is an axis-aligned simple closed boundary, meaning its sides are parallel to the coordinate axes.
codeforces competitive-programming Jun 20, 2026
Practice › Codeforces Solutions › 2025 Argentinian Programming Tournament (TAP) ›

CF 106054I - Inés and her compitas

We are given a repeated decision process over multiple rounds. In each round there is a group of $N+1$ players: Inés and $N$ others. Each round presents two possible mechanisms for distributing gold. In the first mechanism, a subset of players chooses to “share”.
codeforces competitive-programming Jun 20, 2026
Practice › Codeforces Solutions › 2025 Argentinian Programming Tournament (TAP) ›

CF 106054F - Feeding the goat

We are given a convex polygon that represents a fenced garden. One vertex is special: the goat is tied to this vertex with a rope of length $L$. The goat can move freely outside the polygon, but it cannot pass through the fence, and the rope itself cannot cross the fence either.
codeforces competitive-programming Jun 20, 2026
Practice › Codeforces Solutions › 2025 Argentinian Programming Tournament (TAP) ›

CF 106054A - Artifact to print

We are given a single string of fixed length ten, consisting only of uppercase Latin letters. From this string, we are allowed to delete characters, but we are not allowed to rearrange what remains.
codeforces competitive-programming Jun 20, 2026