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

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

13 items

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

Special | 13 problems | 13/13 verified | Difficulty - | 50m 27s

#	Problem	Time	✓
A	\u81ea\u7136\u8bed\u8a00\u5904\u7406	5m 36s	✓
B	The Secret of Time	3m 38s	✓
C	LytchenLovesJSON	2m 55s	✓
D	\u5143\u7d20\u5468\u671f\u8868	1m 50s	✓
E	\u9f99\u8bed\u9b54\u6cd5	1m 31s	✓
F	\u6d74\u7f38	1m 24s	✓
G	\u4f19\u4f34\u7cfb\u7edf	2m 5s	✓
H	\u767d\u5b66\u4e32	2m 23s	✓
I	Integer Factorization	5m 30s	✓
J	\u673a\u623f\u7684\u5723\u8bde\u793c\u7269	2m 36s	✓
K	X-Window System	9m 25s	✓
L	Bonus quiz	10m 22s	✓
M	\u957f\u5b89\u8857\u7684\u534e\u706f	1m 12s	✓

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

CF 102426B - The Secret of Time

There is no input at all. We only need to print one positive integer (x) whose square is a 16 digit decimal number satisfying several digit conditions.

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

CF 102426C - LytchenLovesJSON

The task is essentially to implement a small JSON interpreter. The input begins with one valid JSON document whose root is always an object. The document may contain nested objects, arrays, strings, numbers, booleans, and null.

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

CF 102426H - 白学串

We have an array of positive integers. A query gives an interval [l, r], and asks whether we can choose any three elements from that interval that can be the side lengths of a non-degenerate triangle.

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

CF 102426G - 伙伴系统

The system maintains free memory only through 11 counters. Counter i stores how many free blocks have size 2^i, where i ranges from 0 through 10.

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

CF 102426L - Bonus quiz

There are n lottery tickets numbered from 1 to n. Exactly m of them are lucky, and their positions are given in the input. Miamiao chooses one interval [l, r], with every one of the n(n+1)/2 possible intervals equally likely, and buys every ticket in that interval.

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

CF 102426M - 长安街的华灯

We have (N) identical circular lighting regions. Their centers lie on one straight street, with consecutive centers exactly (L) units apart, and every circle has radius (R). The task is to compute the area covered by at least one light.

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

CF 102426K - X-Window System

We have a screen of width (W) and height (H), and at most ten rectangular windows. The coordinate system is slightly unusual: the first coordinate increases downward and the second increases to the right.

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

CF 102426J - 机房的圣诞礼物

We have gifts numbered from 1 to n. A child may choose any subset of them, with one restriction: whenever the child takes gift x, they cannot also take gift 2x. The value of a chosen set is the sum of all selected gift numbers, and we need the maximum possible value.

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

CF 102426I - Integer Factorization

We are given two integers a and b generated from two unknown primes p and q: [ a=(pq)oplus(p+q), ] [ b=(pq)oplus(p-q). ] The task is to recover the original ordered pair (p, q).

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

CF 102426F - 浴缸

Think of every unit square as a vertical column whose bottom is at height h[i][j] and whose horizontal area is exactly 1. A common horizontal water surface is chosen, and a column contributes water only when its bottom lies below that surface.

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

CF 102426E - 龙语魔法

We have an array of n positive integers. Every pair of indices l <= r defines one contiguous subarray, and its value is the sum of all elements from l through r.

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

CF 102426D - 元素周期表

We need to evaluate several chemical formulas and compute their relative molecular masses. A formula is a sequence of element symbols, where an element symbol consists of one uppercase letter and possibly one lowercase letter.

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

CF 102426A - 自然语言处理

Each text has already been converted into a frequency vector. So the string processing part is completely gone. For one test case, we only need to examine a collection of (n) vectors, each having (m) integer coordinates, and decide whether those vectors are linearly dependent.