Replay of BU - PSTU Programming club collaborative contest

10 problems from Replay of BU - PSTU Programming club collaborative contest (contest 104333), difficulty -. 5/10 solutions verified against sample I/O.

10 items

Replay of BU - PSTU Programming club collaborative contest

Special | 10 problems | 5/10 verified | Difficulty - | 13m 18s

# Problem Rating Tags Accepted Time ✓
A Convolution XOR SUM 1m 15s ✓
B Convolution SUM XOR 1m 16s ✓
C Play With Palindrome 1m 36s
D Median Sum 1m ✓
E A Random Traveller 1m 5s ✓
F Oh no, Again Query? 1m 42s
G Minimum Enclosing Axis-Parallel Square 1m 18s
H Maximum Product 1m 37s
I Hail Pythagoras 1m 51s
J Giveaway? 38s ✓
Practice › Codeforces Solutions › Replay of BU - PSTU Programming club collaborative contest ›

CF 104333I - Hail Pythagoras

We are asked to count integer triples $(a, b, c)$ such that $a le b le c$, all values are positive, and they satisfy the Pythagorean relation $a^2 + b^2 = c^2$.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › Replay of BU - PSTU Programming club collaborative contest ›

CF 104333J - Giveaway?

This problem is not really about processing input or computing a value. The task is to output a single fixed string representing the best programming team from Barisal University. There is no meaningful input structure that affects the answer.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › Replay of BU - PSTU Programming club collaborative contest ›

CF 104333H - Maximum Product

We are given an array for each test case and asked to choose three indices in increasing order, then maximize the product of the three corresponding values.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › Replay of BU - PSTU Programming club collaborative contest ›

CF 104333G - Minimum Enclosing Axis-Parallel Square

We are given several independent sets of points on a 2D plane. For each set, we must enclose all points inside an axis-aligned square, meaning the square’s sides are parallel to the coordinate axes.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › Replay of BU - PSTU Programming club collaborative contest ›

CF 104333F - Oh no, Again Query?

We are given an undirected graph where each vertex initially carries a value. Over time, edges are removed, vertex values are updated, and queries ask for the maximum vertex value inside the connected component of a given node.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › Replay of BU - PSTU Programming club collaborative contest ›

CF 104333E - A Random Traveller

We are repeatedly picking a city uniformly at random from the set of $n$ cities, and each time we pick a city we pay its associated cost. The process stops only when every city has been seen at least once.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › Replay of BU - PSTU Programming club collaborative contest ›

CF 104333D - Median Sum

We are working with an integer array and we are allowed to pick any subsequence, meaning we can freely choose a subset of indices and keep their values in order, but order itself does not affect the computation since only sums matter.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › Replay of BU - PSTU Programming club collaborative contest ›

CF 104333C - Play With Palindrome

We are given a string of lowercase letters and for every position we want to know how “large a palindrome we can sit inside” while forcing that position to be part of it.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › Replay of BU - PSTU Programming club collaborative contest ›

CF 104333B - Convolution SUM XOR

We are asked to look at all possible ways of pairing two arrays through a permutation, compute a bitwise XOR-based score for each pairing, and then sum those scores over every permutation. Concretely, we have two arrays a and b, both of length n.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › Replay of BU - PSTU Programming club collaborative contest ›

CF 104333A - Convolution XOR SUM

We are given two arrays of equal length. One array represents values attached to indices we are allowed to permute, and the other array represents fixed “slots”.
codeforces competitive-programming Jul 1, 2026