The 17-th BIT Campus Programming Contest - Online Round

7 problems from The 17-th BIT Campus Programming Contest - Online Round (contest 104823), difficulty -. 6/7 solutions verified against sample I/O.

7 items

The 17-th BIT Campus Programming Contest - Online Round

Special | 7 problems | 6/7 verified | Difficulty - | 5m 33s

# Problem Rating Tags Accepted Time ✓
A \u8d5b\u524d\u987b\u77e5 24s
B turn 48s ✓
C Warp Shuffle 53s ✓
D \u5854\u5b66\u7591\u4e91 1m 7s ✓
E string 41s ✓
F \u51fa\u9898\u51fa\u9898\u4eba 56s ✓
G \u5206\u8fa8\u77e9\u9635 44s ✓
Practice › Codeforces Solutions › The 17-th BIT Campus Programming Contest - Online Round ›

CF 104823G - 分辨矩阵

We are given several binary matrices of identical size. Each matrix can be seen as a function from grid positions to bits, and no two matrices in the input are identical.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › The 17-th BIT Campus Programming Contest - Online Round ›

CF 104823F - 出题出题人

We are interacting with a system that has a hidden integer threshold $l$, uniformly chosen from the integers in $[x, y]$. When we click a save button after typing some number of characters, the system checks how long we have been typing since the previous successful save.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › The 17-th BIT Campus Programming Contest - Online Round ›

CF 104823D - 塔学疑云

We are simulating a simplified version of a Slay the Spire style system centered around “dark orbs”. The system evolves through a long sequence of operations, where we maintain a row of orbs, a global “focus” value, and a timeline of end-of-turn effects.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › The 17-th BIT Campus Programming Contest - Online Round ›

CF 104823E - string

We are given a string of length $n$ where each position holds a visible ASCII character. Then we are given $m$ operations, each operation picks two distinct characters $(x, y)$.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › The 17-th BIT Campus Programming Contest - Online Round ›

CF 104823C - Warp Shuffle

We are given a fixed-size array of 32 integers representing a “warp”. Each operation describes a restricted in-place transformation on this array.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › The 17-th BIT Campus Programming Contest - Online Round ›

CF 104823B - turn

We are given a bicycle moving inside a very narrow corridor modeled as two infinite parallel lines with fixed distance between them. The bicycle itself is treated as a rigid segment of length l.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › The 17-th BIT Campus Programming Contest - Online Round ›

CF 104823A - 赛前须知

Codeforces 104823A: 赛前须知
codeforces competitive-programming Jun 28, 2026