The 15-th BIT Campus Programming Contest - Onsite Round

13 problems from The 15-th BIT Campus Programming Contest - Onsite Round (contest 102878), difficulty -. 10/13 solutions verified against sample I/O.

13 items

The 15-th BIT Campus Programming Contest - Onsite Round

Special | 13 problems | 10/13 verified | Difficulty - | 9m 17s

#	Problem	Time	✓
A	IQ difference	33s	✓
B	Residue Problem	48s	✓
C	Simple AniPop	53s	✓
D	Life Game	39s	✓
E	Eigen Substring	41s	✓
F	SVM	30s
G	Nim plus	41s	✓
H	Treasure Hunt	42s	✓
I	Nobody Knows Better Than Me	40s
J	Teacher Long and Machine Learning	42s	✓
K	Number Puzzle	42s
L	Long Long Wanna Buy	47s	✓
M	Camouflage	59s	✓

Practice › Codeforces Solutions › The 15-th BIT Campus Programming Contest - Onsite Round ›

CF 102878C - Simple AniPop

We have a ring of objects, each with a positive value. A move removes one object that still exists. The score gained from that removal is the product of the removed object's current two neighbors and the removed object's own value.

Practice › Codeforces Solutions › The 15-th BIT Campus Programming Contest - Onsite Round ›

CF 102878A - IQ difference

The task is to find the single number in a list whose parity is different from all the others. The input describes a sequence of integers. Every value except one is either even or odd, while the remaining value has the opposite parity.

Practice › Codeforces Solutions › The 15-th BIT Campus Programming Contest - Onsite Round ›

CF 102878M - Camouflage

The camouflage is represented as a rectangular grid of black and white pixels. White pixels form separate spots, and a spot can be repainted only when it is completely surrounded by black pixels in the four orthogonal directions.

Practice › Codeforces Solutions › The 15-th BIT Campus Programming Contest - Onsite Round ›

CF 102878L - Long Long Wanna Buy

We need build a computer by selecting exactly one accessory from every kind. Each accessory has a price and a service life.

Practice › Codeforces Solutions › The 15-th BIT Campus Programming Contest - Onsite Round ›

CF 102878K - Number Puzzle

I can write the editorial, but the requested format is not compatible with this problem as stated. Codeforces 102878K - Number Puzzle is an interactive problem.

Practice › Codeforces Solutions › The 15-th BIT Campus Programming Contest - Onsite Round ›

CF 102878J - Teacher Long and Machine Learning

The task is to recover the coefficients of a fourth-degree polynomial from five observed values. The five observations correspond to the polynomial evaluated at x = 1, 2, 3, 4, and 5, but every observation may contain an error of at most one.

Practice › Codeforces Solutions › The 15-th BIT Campus Programming Contest - Onsite Round ›

CF 102878I - Nobody Knows Better Than Me

I can write the full editorial, but the problem statement section is empty and I could not reliably recover the actual statement for Codeforces 102878I - “Nobody Knows Better Than Me” from the information available.

Practice › Codeforces Solutions › The 15-th BIT Campus Programming Contest - Onsite Round ›

CF 102878H - Treasure Hunt

The game is played on a directed acyclic graph. A single turn starts at node 1 and finishes when we reach node n. Every time a turn visits a node, that node contributes its reward to the total score. Each directed edge can only be used a limited number of times across all turns.

Practice › Codeforces Solutions › The 15-th BIT Campus Programming Contest - Onsite Round ›

CF 102878G - Nim plus

The game is played with a single pile containing n paper balls. Long Long and Mao Mao do not share the same legal moves. Long Long has a set of numbers he is allowed to remove, and Mao Mao has another set.

Practice › Codeforces Solutions › The 15-th BIT Campus Programming Contest - Onsite Round ›

CF 102878F - SVM

Part 2 will contain: I’ll continue with Part 1 in the next message.

Practice › Codeforces Solutions › The 15-th BIT Campus Programming Contest - Onsite Round ›

CF 102878E - Eigen Substring

We are given a lowercase string s. A substring of a string is called an eigen substring when that exact sequence of characters appears only once inside the string. The task is to look at every prefix of s and find the length of the shortest eigen substring inside that prefix.

Practice › Codeforces Solutions › The 15-th BIT Campus Programming Contest - Onsite Round ›

CF 102878D - Life Game

The task simulates a cellular automaton on a rectangular grid. Each position contains either a living creature () or an empty cell (.). At every moment, every cell updates at the same time.

Practice › Codeforces Solutions › The 15-th BIT Campus Programming Contest - Onsite Round ›

CF 102878B - Residue Problem

The problem asks us to answer many independent queries. In each query, a prime modulus P is fixed, and we define a value f(i,r,P) as the number of pairs (a,b) modulo P satisfying a modular equation involving a^r, b, and b^2.