NUS CS3233 Final Team Contest 2025

13 problems from NUS CS3233 Final Team Contest 2025 (contest 105833), difficulty -. 10/13 solutions verified against sample I/O.

13 items

NUS CS3233 Final Team Contest 2025

Special | 13 problems | 10/13 verified | Difficulty - | 9m 23s

# Problem Rating Tags Accepted Time ✓
A Anti-Diagonal Game 52s ✓
B BrIllIance of Wings 44s ✓
C Chimchar Defense 1m 2s ✓
D Double String 57s ✓
E Energy Extraction 45s ✓
F Fair Forgery 46s ✓
G Game of Two Choices 42s ✓
H Help Eevee Pls Eh 33s ✓
I Independent Inversions 43s ✓
J Job Interview 40s
K Kanto To Johto 47s ✓
L Last Goal 24s
M Miracles can be Created 28s
Practice › Codeforces Solutions › NUS CS3233 Final Team Contest 2025 ›

CF 105833L - Last Goal

I can't write a correct editorial for this problem because the prompt does not include the actual problem statement.
codeforces competitive-programming Jun 26, 2026
Practice › Codeforces Solutions › NUS CS3233 Final Team Contest 2025 ›

CF 105833J - Job Interview

I can’t write a correct editorial for this yet because the actual problem content is missing. Right now the “Problem Statement” is just: That gives no information about the task, inputs, outputs, or constraints, so anything I write would be guesswork rather than a…
codeforces competitive-programming Jun 26, 2026
Practice › Codeforces Solutions › NUS CS3233 Final Team Contest 2025 ›

CF 105833M - Miracles can be Created

Got it - I can write a full Codeforces-style editorial (with intuition, proofs, edge cases, complexity, and implementation notes). But I’ll need the actual problem first.
codeforces competitive-programming Jun 26, 2026
Practice › Codeforces Solutions › NUS CS3233 Final Team Contest 2025 ›

CF 105833B - BrIllIance of Wings

We have two different trees on the same set of N vertices. The first tree is the current structure and the second tree is the desired final structure. One operation cuts one existing edge and then adds another edge so the graph remains a tree.
codeforces competitive-programming Jun 26, 2026
Practice › Codeforces Solutions › NUS CS3233 Final Team Contest 2025 ›

CF 105833H - Help Eevee Pls Eh

The only information available for this problem is the title identifier and an empty statement section. There are no definitions of the input, no constraints, and no description of what constitutes a valid output.
codeforces competitive-programming Jun 26, 2026
Practice › Codeforces Solutions › NUS CS3233 Final Team Contest 2025 ›

CF 105833A - Anti-Diagonal Game

We have a string S of length N + 1, where each position on the anti-diagonal of a grid is labeled either A or B. A token starts at (0, 0) in an (N + 1) × (N + 1) grid. Players alternate moves, and each move increases either the row index or the column index by one.
codeforces competitive-programming Jun 26, 2026
Practice › Codeforces Solutions › NUS CS3233 Final Team Contest 2025 ›

CF 105833F - Fair Forgery

We are given M rankings of N candidates. Each ranking is a permutation of 1..N, where smaller positions mean better ranks. The task is to construct K new rankings, also permutations of 1..N, satisfying a fairness condition.
codeforces competitive-programming Jun 26, 2026
Practice › Codeforces Solutions › NUS CS3233 Final Team Contest 2025 ›

CF 105833K - Kanto To Johto

The problem can be viewed as a graph exploration problem where each edge is a train line with an associated cost, but the cost is not paid immediately.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › NUS CS3233 Final Team Contest 2025 ›

CF 105833I - Independent Inversions

We are given a sequence of positions, each position carrying two values. You can think of it as each index having two “ranks” assigned to it, one from the first ordering and one from the second ordering.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › NUS CS3233 Final Team Contest 2025 ›

CF 105833G - Game of Two Choices

We are given a directed graph where each vertex has outgoing edges to a set of neighbors. A token starts at a chosen vertex, and two players move it along edges turn by turn while accumulating a score.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › NUS CS3233 Final Team Contest 2025 ›

CF 105833E - Energy Extraction

We are given a collection of energy containers, each starting with some amount of energy. We are allowed to move energy between containers, but every transfer is inefficient: if we move some amount from one container to another, a fixed percentage of what we try to move is…
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › NUS CS3233 Final Team Contest 2025 ›

CF 105833C - Chimchar Defense

We are given a line of positions from left to right, and each position contains both an enemy and a defender. Enemy at position $i$ starts with a health value $Hi$.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › NUS CS3233 Final Team Contest 2025 ›

CF 105833D - Double String

We are given a single lowercase string and we are asked to count special substrings that have a very rigid structure.
codeforces competitive-programming Jun 21, 2026