2017-2018 ICPC Central Quarter Final of Northeastern European Regional Collegiate Programming Contest
12 problems from 2017-2018 ICPC Central Quarter Final of Northeastern European Regional Collegiate Programming Contest (contest 102788), difficulty -. 8/12 solutions verified against sample I/O.
2017-2018 ICPC Central Quarter Final of Northeastern European Regional Collegiate Programming Contest
ICPC/IOI | 12 problems | 8/12 verified | Difficulty - | 25m 25s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Normal Magic Square | 39s | ✓ | |||
| B | Rectangles | 1m 54s | ✓ | |||
| C | Magic football | 27s | ||||
| D | 38 parrots | 12m 29s | ||||
| E | Black Box | 1m 31s | ||||
| F | Spying Game | 1m 27s | ✓ | |||
| G | Alice And Bob | 1m 46s | ✓ | |||
| H | Exam | 1m 5s | ✓ | |||
| I | Hole Punch | 1m 44s | ✓ | |||
| J | Multidimensional Points | 37s | ||||
| K | Tower of Hanoi | 59s | ✓ | |||
| L | Fence | 47s | ✓ |
CF 102788G - Alice And Bob
The game is played on a row of positive integers. Alice moves first. On a turn, a player chooses two neighboring numbers that have a common divisor greater than one. The chosen pair is simplified by dividing both numbers by their greatest common divisor.
CF 102788F - Spying Game
The task asks us to rebuild a directed acyclic graph of cities. City m is the source of all shipments. For every city i, we are given D[i], the number of different directed paths that start at m and end at i.
CF 102788L - Fence
The task is not asking us to construct the whole magic square. We only need the sum of the numbers placed in its first row. A normal magic square of size n contains every integer from 1 to n² exactly once, and every row has the same sum.
CF 102788K - Tower of Hanoi
The problem gives the intermediate positions of several teams while they were executing the classical three-rod Tower of Hanoi solution. Each team followed exactly the same recursive procedure, moving all N disks from rod A to rod B.
CF 102788J - Multidimensional Points
I need the actual problem details to write a correct editorial and solution. Please provide the full statement or input/output description. Waiting for your answer
CF 102788I - Hole Punch
The problem describes a strip of paper with n equally spaced positions where holes must be punched. A punch tool always creates exactly two holes, and the distance between those two holes is fixed by the tool.
CF 102788H - Exam
We have a machine that starts with the value 1. A program for this machine is a sequence of commands. One command increases the current value by 1, another increases it by an unknown value x greater than 1, and the third multiplies the current value by 7.
CF 102788D - 38 parrots
The prompt you provided is not solvable as written because it does not actually contain a complete, unambiguous statement for Codeforces 102788D.
CF 102788E - Black Box
I can write the editorial, but the problem statement provided here is incomplete. The “Problem Statement”, “Input”, and “Output” sections only contain placeholders, so I do not have enough information to reliably explain the required algorithm, prove correctness…
CF 102788B - Rectangles
A rectangle is drawn on a grid, and every cell inside it is classified as either external or internal. External cells touch at least one side of the rectangle, while internal cells are completely surrounded by other cells.
CF 102788C - Magic football
This request requires deriving and explaining the algorithm for a specific competitive programming problem, including a correct implementation.
CF 102788A - Normal Magic Square
A normal magic square of order n is an n × n arrangement containing every number from 1 to n² exactly once. The sum of every row, every column, and both main diagonals is the same value. The task is not to build the square.