Maratona dos Bixes 2023 - UNICAMP

11 problems from Maratona dos Bixes 2023 - UNICAMP (contest 104344), difficulty -. 8/11 solutions verified against sample I/O.

11 items

Maratona dos Bixes 2023 - UNICAMP

Special | 11 problems | 8/11 verified | Difficulty - | 13m 38s

# Problem Rating Tags Accepted Time ✓
A Distribuindo doces 1m 12s ✓
B Triplas pitag\u00f3ricas 1m 21s ✓
C Martelo 1m 28s ✓
D Prova 1m 21s
E Copos 1m 16s ✓
F Pegadinha 1m 32s
G Presentes de P\u00e1scoa 1m 4s ✓
H Shrek II 1m 35s ✓
I Fila da cantina 1m 1s ✓
J But\u00e3o 1m 14s ✓
K Picol\u00e9s e tri\u00e2ngulos 34s
Practice › Codeforces Solutions › Maratona dos Bixes 2023 - UNICAMP ›

CF 104344J - Butão

We start at a state that is just a single digit, initially 0. Every time we press the button, we replace the current digit with another digit according to a fixed transition rule defined by an array of size 3.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › Maratona dos Bixes 2023 - UNICAMP ›

CF 104344K - Picolés e triângulos

I can’t reliably write a correct editorial for “Codeforces 104344K - Picolés e triângulos” because the actual problem statement (inputs, outputs, constraints, and rules) is not included in your message.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › Maratona dos Bixes 2023 - UNICAMP ›

CF 104344H - Shrek II

We are given two piles of coins, one with $A$ coins and another with $B$ coins. Two players alternate turns, and in each turn a player must remove exactly one coin either from the first pile, or from the second pile, or from both piles simultaneously.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › Maratona dos Bixes 2023 - UNICAMP ›

CF 104344I - Fila da cantina

We are given a row of children, where each position already contains a child, but each child has a target position they are supposed to occupy.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › Maratona dos Bixes 2023 - UNICAMP ›

CF 104344G - Presentes de Páscoa

Fred has a list of chocolate eggs, each with a known price in cents, and a fixed amount of money. The task is to determine how many eggs he can buy at most if he chooses them optimally.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › Maratona dos Bixes 2023 - UNICAMP ›

CF 104344F - Pegadinha

We are given a building with floors numbered from 1 to N. Initially, every floor has its light turned off. A sequence of N people walks through and toggles switches in a structured way. The i-th person toggles every floor number that is a multiple of i.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › Maratona dos Bixes 2023 - UNICAMP ›

CF 104344E - Copos

We are asked to construct a rectangular box whose volume is exactly $V$, where all three side lengths must be positive integers. If the sides are $a$, $b$, and $c$, then the constraint is $a cdot b cdot c = V$.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › Maratona dos Bixes 2023 - UNICAMP ›

CF 104344D - Prova

Each student’s result comes from a very small fixed universe: there are exactly three independent problems, worth 1, 2, and 4 points.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › Maratona dos Bixes 2023 - UNICAMP ›

CF 104344C - Martelo

We are working on a one-dimensional movement problem on the number line. Eren starts at position 0 and wants to reach a target position X. Along the way, there is a wall located at Y, which blocks passage until Eren obtains a hammer at position Z.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › Maratona dos Bixes 2023 - UNICAMP ›

CF 104344B - Triplas pitagóricas

We are given two integers $m$ and $n$, with $1 le n < m le 10^4$. From these two values, we must construct a triple of integers using a fixed algebraic recipe and print the result in a specific order. The construction is not arbitrary.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › Maratona dos Bixes 2023 - UNICAMP ›

CF 104344A - Distribuindo doces

We are asked whether it is possible to distribute exactly $K$ candies among $N$ children under two constraints. Every child must receive at least $L$ candies, and no child may receive more than $R$ candies.
codeforces competitive-programming Jul 1, 2026