Bangladesh CP Server - BCS Round 1 (Div. 3)

6 problems from Bangladesh CP Server - BCS Round 1 (Div. 3) (contest 104289), difficulty -. 1/6 solutions verified against sample I/O.

6 items

Bangladesh CP Server - BCS Round 1 (Div. 3)

Div. 3 | 6 problems | 1/6 verified | Difficulty - | 6m 54s

# Problem Rating Tags Accepted Time ✓
A String Removal 39s
B OR-bitax 1m 15s ✓
C Equal Digits 1m 17s
D GCD in Median Land 27s
E Non-decreasing Sequence 2m
F Pull Smaller 1m 16s
Practice › Codeforces Solutions › Bangladesh CP Server - BCS Round 1 (Div. 3) ›

CF 104289E - Non-decreasing Sequence

Let $f^{D}(x1,dots,xn)=overline{f(overline{x1},dots,overline{xn})}$ and $f^{R}(x1,dots,xn)=f(xn,dots,x1)$. Composition yields $$f^{DR}(x)=overline{f(overline{xn},dots,overline{x1})},qquad f^{RD}(x)=overline{f(overline{xn},dots,overline{x1})},$$ so $f^{DR}=f^{RD}$ follows from…
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › Bangladesh CP Server - BCS Round 1 (Div. 3) ›

CF 104289F - Pull Smaller

We are given an initial sequence and a target sequence, both permutations of the same multiset of values. We are allowed to repeatedly perform a very specific operation: pick two positions i and j with i < j where the value at i is larger than the value at j, and then take the…
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › Bangladesh CP Server - BCS Round 1 (Div. 3) ›

CF 104289C - Equal Digits

We are given a positive integer $n$, and we need to find the smallest integer $k$ such that $k ge n$ and every digit of $k$ is identical. Such numbers look like $1, 2, 3, dots, 9, 11, 22, 33, dots, 9999$, where a single digit is repeated some number of times.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › Bangladesh CP Server - BCS Round 1 (Div. 3) ›

CF 104289B - OR-bitax

We are given a sequence of integers, and we are allowed to cut it into contiguous non-empty pieces. For each piece, we compute a value called its score, defined as the bitwise XOR of all elements inside that piece.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › Bangladesh CP Server - BCS Round 1 (Div. 3) ›

CF 104289D - GCD in Median Land

Let $f^{D}(x1,dots,xn)=overline{f(overline{x1},dots,overline{xn})}$ and $f^{R}(x1,dots,xn)=f(xn,dots,x1)$. Composition yields $$f^{DR}(x)=overline{f(overline{xn},dots,overline{x1})},qquad f^{RD}(x)=overline{f(overline{xn},dots,overline{x1})},$$ so $f^{DR}=f^{RD}$ follows from…
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › Bangladesh CP Server - BCS Round 1 (Div. 3) ›

CF 104289A - String Removal

Connection interrupted. Waiting for the complete answer
codeforces competitive-programming Jul 1, 2026