The 9-th BIT Campus Programming Contest for Junior Grade Group

7 problems from The 9-th BIT Campus Programming Contest for Junior Grade Group (contest 103192), difficulty -. 6/7 solutions verified against sample I/O.

7 items

The 9-th BIT Campus Programming Contest for Junior Grade Group

Special | 7 problems | 6/7 verified | Difficulty - | 8m 8s

#	Problem	Time	✓
A	\u51fa\u9898\u4eba\u7684\u788e\u788e\u5ff5	2m 31s
B	\u9875\u9762\u7f6e\u6362	1m 2s	✓
D	\u6cd5\u529b\u98ce\u66b4	59s	✓
E	\u8089\u5939\u998d	57s	✓
G	\u7406\u8d22\u5927\u5e08	53s	✓
H	\u5b88\u95e8\u5458	55s	✓
L	\u96f6\u65f6\u56f0\u5883	51s	✓

Practice › Codeforces Solutions › The 9-th BIT Campus Programming Contest for Junior Grade Group ›

CF 103192H - 守门员

We are looking at repeated shots in a 2D plane where a player kicks a ball from a fixed point toward a goal represented by two posts on the x-axis. The goal is the open segment between two points on the x-axis, centered at the origin and spanning from x = −w to x = w at y = 0.

Practice › Codeforces Solutions › The 9-th BIT Campus Programming Contest for Junior Grade Group ›

CF 103192L - 零时困境

We are given a hidden permutation of length $n$, meaning the numbers from 1 to $n$ appear exactly once in some unknown order.

Practice › Codeforces Solutions › The 9-th BIT Campus Programming Contest for Junior Grade Group ›

CF 103192A - 出题人的碎碎念

Let the canonical bases be represented in the form $(alpha1,dots,alphat)$ as in exercise 12, where each $alphai$ is a binary string of length $n$ with exactly one distinguished position equal to $1$.

Practice › Codeforces Solutions › The 9-th BIT Campus Programming Contest for Junior Grade Group ›

CF 103192E - 肉夹馍

We are given a binary string that describes a “nested structure” from the innermost layer to the outermost layer.

Practice › Codeforces Solutions › The 9-th BIT Campus Programming Contest for Junior Grade Group ›

CF 103192G - 理财大师

We are given a sequence of future exchange rates between a cryptocurrency and RMB at discrete time moments. At each moment, the price of 1 bitc is known in advance. A trader starts with zero cryptocurrency and unlimited RMB.

Practice › Codeforces Solutions › The 9-th BIT Campus Programming Contest for Junior Grade Group ›

CF 103192B - 页面置换

The task models a classic page replacement scenario from operating systems. We are given a sequence of page requests, where each request asks for a page from a fixed universe of pages. Memory has limited capacity, so it can only hold a small number of pages at once.

Practice › Codeforces Solutions › The 9-th BIT Campus Programming Contest for Junior Grade Group ›

CF 103192D - 法力风暴

We are given several independent test cases. In each test case, there are several spells. Each spell consumes two kinds of resources, a red amount and a blue amount.