2026 USACO.Guide Informatics Tournament

11 problems from 2026 USACO.Guide Informatics Tournament (contest 106430), difficulty -. 11/11 solutions verified against sample I/O.

11 items

2026 USACO.Guide Informatics Tournament

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

# Problem Rating Tags Accepted Time ✓
A Bessie and Trap 43s ✓
B Bessie And Rounding 43s ✓
C Bessie and Array 56s ✓
D Bessie and Infinite Dungeon 54s ✓
E Bessie and Groups 49s ✓
F Bessie at the Bank 52s ✓
G Bessie and Kaprekar 2m 33s ✓
H Bessie and GCD 50s ✓
I Bessie and XOR 52s ✓
J Bessie and Gifts 50s ✓
K Bessie and Heist 52s ✓
Practice › Codeforces Solutions › 2026 USACO.Guide Informatics Tournament ›

CF 106430B - Bessie And Rounding

We have a number X and want to turn it into another number Y. One operation chooses a positive integer M and rounds X to the closest multiple of M. If two multiples are equally close, the larger one is chosen.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › 2026 USACO.Guide Informatics Tournament ›

CF 106430A - Bessie and Trap

We are given a process where a character moves through a sequence of rooms in order, carrying a number of keys that changes as they progress. They start with some initial number of keys, and each room adds a fixed number of keys.
codeforces competitive-programming Jun 21, 2026
Practice › Codeforces Solutions › 2026 USACO.Guide Informatics Tournament ›

CF 106430H - Bessie and GCD

We are given a number $r$, and we want to compute a function built from counting pairs of positive integers under a constraint involving their sum and gcd structure.
codeforces competitive-programming Jun 21, 2026
Practice › Codeforces Solutions › 2026 USACO.Guide Informatics Tournament ›

CF 106430J - Bessie and Gifts

We are given a process involving Bessie and a sequence of gifts, where each gift has some value and the structure of the task suggests that we repeatedly combine or reason about contiguous segments of these gifts.
codeforces competitive-programming Jun 21, 2026
Practice › Codeforces Solutions › 2026 USACO.Guide Informatics Tournament ›

CF 106430F - Bessie at the Bank

We are maintaining a security code represented as an array of integers that changes over time. After each change, we need to evaluate a condition based on a fixed list of “favorite numbers” $d1, d2, dots, dD$, where $D le 30$.
codeforces competitive-programming Jun 20, 2026
Practice › Codeforces Solutions › 2026 USACO.Guide Informatics Tournament ›

CF 106430K - Bessie and Heist

We are given a circular structure with n positions, each carrying a value. A process is defined where we choose a “step size” d, and then repeatedly jump around the circle by adding d modulo n.
codeforces competitive-programming Jun 20, 2026
Practice › Codeforces Solutions › 2026 USACO.Guide Informatics Tournament ›

CF 106430E - Bessie and Groups

We are given an array that is partitioned into consecutive groups of fixed size, and the task is to determine whether the structure can be rearranged into a globally sorted order under constraints that preserve group structure.
codeforces competitive-programming Jun 20, 2026
Practice › Codeforces Solutions › 2026 USACO.Guide Informatics Tournament ›

CF 106430I - Bessie and XOR

The task can be seen as working on a system of constraints over XOR values, but the constraints are not written directly in terms of edges and nodes. Instead, they originate from operations on segments of an array, which can be reinterpreted into a graph problem.
codeforces competitive-programming Jun 20, 2026
Practice › Codeforces Solutions › 2026 USACO.Guide Informatics Tournament ›

CF 106430C - Bessie and Array

We are given an array of integers and we want to determine whether it is possible to transform it into its reverse using exactly K swap operations. A swap operation exchanges the values of any two positions in the array.
codeforces competitive-programming Jun 20, 2026
Practice › Codeforces Solutions › 2026 USACO.Guide Informatics Tournament ›

CF 106430G - Bessie and Kaprekar

We are working with numbers that are fundamentally treated through their digit structure rather than their arithmetic value. For any integer (x), we repeatedly apply a transformation that depends only on the multiset of its digits.
codeforces competitive-programming Jun 19, 2026
Practice › Codeforces Solutions › 2026 USACO.Guide Informatics Tournament ›

CF 106430D - Bessie and Infinite Dungeon

The problem describes a sequence of bosses in an infinite dungeon and a resource-driven decision process while traversing them.
codeforces competitive-programming Jun 19, 2026