2025 Fujian Normal University Programming Contest

12 problems from 2025 Fujian Normal University Programming Contest (contest 105902), difficulty -. 12/12 solutions verified against sample I/O.

12 items

2025 Fujian Normal University Programming Contest

Special | 12 problems | 12/12 verified | Difficulty - | 11m 8s

#	Problem	Time	✓
A	One Must Imagine Time Tight,	47s	✓
B	Uchiage Hanabi	56s	✓
C	Sequential Sequence	51s	✓
D	Where's My Money?	49s	✓
E	Binary Banter: Counting Combinatorial Bits	57s	✓
F	Imbalanced Bracket	49s	✓
G	Still No Money?	45s	✓
H	Yet Another Tree Problem	1m 25s	✓
I	DJ Mr. Spin	1m 14s	✓
J	Spirit of Cola.	52s	✓
L	We Luv Stamina	41s	✓
M	The Journey Onwards...	1m 2s	✓

Practice › Codeforces Solutions › 2025 Fujian Normal University Programming Contest ›

CF 105902M - The Journey Onwards...

We are given a line with several special landing points, each located at some distance from the starting position. KP starts at position 0 and wants to reach the farthest of these points. Movement is done in two ways.

Practice › Codeforces Solutions › 2025 Fujian Normal University Programming Contest ›

CF 105902E - Binary Banter: Counting Combinatorial Bits

We are given a number $n$, and for every integer $i$ from $0$ to $n$, we look at the entire $i$-th row of Pascal’s triangle. For each entry in that row, we take the binomial coefficient $binom{i}{j}$, reduce it modulo 2, and sum all those values.

Practice › Codeforces Solutions › 2025 Fujian Normal University Programming Contest ›

CF 105902D - Where's My Money?

We are given three people who travel together, and each of them pays a sequence of bills during the trip. Each test case provides three lists of positive amounts, one list per person.

Practice › Codeforces Solutions › 2025 Fujian Normal University Programming Contest ›

CF 105902I - DJ Mr. Spin

We are given a system where everything rotates around the origin, while a second object moves straight outward along the positive x-axis after we choose a starting time. Inside a fixed circle, there are many points attached to the rotating system.

Practice › Codeforces Solutions › 2025 Fujian Normal University Programming Contest ›

CF 105902H - Yet Another Tree Problem

We are given a sequence of tree heights. We must perform exactly $s$ operations, and each operation reduces the height of exactly one tree by one unit.

Practice › Codeforces Solutions › 2025 Fujian Normal University Programming Contest ›

CF 105902L - We Luv Stamina

We are given a binary grid with n rows and 4 columns. Each cell tells us whether a note exists at that time step (row) and lane (column). A 1 means a note must be played, and a 0 means empty space.

Practice › Codeforces Solutions › 2025 Fujian Normal University Programming Contest ›

CF 105902G - Still No Money?

We are given a two-player deterministic game played with a pile of skewers. At the start there are x skewers and a parameter k. Players alternate turns, with OC always moving first.

Practice › Codeforces Solutions › 2025 Fujian Normal University Programming Contest ›

CF 105902B - Uchiage Hanabi

We are given a line of positions from 1 to n. A player starts at one of the two endpoints and moves forward in time through m events.

Practice › Codeforces Solutions › 2025 Fujian Normal University Programming Contest ›

CF 105902C - Sequential Sequence

We are given an array that changes over time, and we must answer two kinds of queries on it. One query modifies a single position, and the other asks whether a chosen contiguous segment of the array has a very specific property. The property itself is defined indirectly.

Practice › Codeforces Solutions › 2025 Fujian Normal University Programming Contest ›

CF 105902J - Spirit of Cola.

We are given a very small system: three cups with fixed capacities and current amounts of cola. We can move liquid between cups with a simple rule that always pours as much as possible until either the source empties or the destination fills.

Practice › Codeforces Solutions › 2025 Fujian Normal University Programming Contest ›

CF 105902F - Imbalanced Bracket

We are given a string made of opening and closing brackets. We are allowed to change characters one by one, each change turning a bracket into the opposite type. After performing some number of such changes, we look at every possible non-empty subsequence of the resulting string.

Practice › Codeforces Solutions › 2025 Fujian Normal University Programming Contest ›

CF 105902A - One Must Imagine Time Tight,

We are given three candidate routes or plans for completing the same task, each associated with a time cost. The goal is simply to choose the fastest option among the three and output its time. Each input consists of exactly three integers.