The 2024 CCPC National Invitational Contest (Northeast), The 18th Northeast Collegiate Programming Contest
13 problems from The 2024 CCPC National Invitational Contest (Northeast), The 18th Northeast Collegiate Programming Contest (contest 105173), difficulty -. 4/13 solutions verified against sample I/O.
The 2024 CCPC National Invitational Contest (Northeast), The 18th Northeast Collegiate Programming Contest
Special | 13 problems | 4/13 verified | Difficulty - | 8m 37s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Paper Watering | 50s | ✓ | |||
| B | Charging Station | 36s | ||||
| C | Ring | 37s | ||||
| D | nIM gAME | 27s | ||||
| E | Checksum | 21s | ||||
| F | Factor | 57s | ✓ | |||
| G | Diamond | 20s | ||||
| H | Meet | 53s | ||||
| I | Password | 29s | ||||
| J | Breakfast | 47s | ✓ | |||
| K | Tasks | 35s | ||||
| L | Bracket Generation | 1m 16s | ✓ | |||
| M | House | 29s |
CF 105173L - Bracket Generation
We are given a fully balanced parentheses string. Think of it as a structure built from nested and concatenated segments, where every matching pair of parentheses defines a “container” that may itself contain several smaller balanced pieces.
CF 105173M - House
We are given a set of distinct points on the plane, and we want to count how many ways we can choose five of them so that they form a specific geometric configuration called a “house”. A valid house consists of five labeled points $A, B, C, D, E$ with a rigid structure.
CF 105173J - Breakfast
We are given a single meal order composed of two types of items: steamed buns and eggs. Each bun has a fixed price of 0.6 units of currency, and each egg costs 1 unit. The order size is fully specified by two integers: the number of buns and the number of eggs.
CF 105173K - Tasks
Working
CF 105173H - Meet
The problem statement in your prompt is incomplete, so it is impossible to produce a correct editorial or implementation.
CF 105173F - Factor
We are given three integers $p$, $x$, and $k$. We consider all integers $q$ in the range from 1 to $x$. For each such $q$, we form the product $p cdot q$, and we write this number in base $k$.
CF 105173I - Password
Working
CF 105173G - Diamond
We are g
CF 105173D - nIM gAME
I do not have enough information to write a correct editorial for this problem because the statement you provided is incomplete. The statement is missing the actual sample input values.
CF 105173E - Checksum
Codeforces 105173E: Checksum
CF 105173A - Paper Watering
We start with a single integer $x$. From this number we are allowed to apply up to $k$ operations, where each operation is either taking the integer square root (flooring it) or squaring it.
CF 105173C - Ring
We are given a circular necklace of length $n$, where each bead is either red or blue. The beads are indexed around a ring, so index arithmetic wraps around modulo $n$.
CF 105173B - Charging Station
The problem statement in your prompt is incomplete and internally inconsistent, so it is not possible to write a correct editorial or derive the intended algorithm. Several essential pieces of information are missing or corrupted: 1. The sample input is clearly truncated.