Open Udmurtia Junior Programming Contest 2018

11 problems from Open Udmurtia Junior Programming Contest 2018 (contest 105581), difficulty -. 11/11 solutions verified against sample I/O.

11 items

Open Udmurtia Junior Programming Contest 2018

Special | 11 problems | 11/11 verified | Difficulty - | 11m 8s

# Problem Rating Tags Accepted Time ✓
A Scanner 55s ✓
B Patrol 44s ✓
C File Manager 1m 12s ✓
D Mosquitoes 58s ✓
E Net 1m 27s ✓
F Equity 43s ✓
G Robot Vacuum Cleaner 1m 3s ✓
H Amphitheater 59s ✓
I Conflagration 1m ✓
J Origami 54s ✓
K Magic Chess Piece 1m 13s ✓
Practice › Codeforces Solutions › Open Udmurtia Junior Programming Contest 2018 ›

CF 105581E - Net

We are given a set of points in 3D that form a convex polyhedron. The task is not to reconstruct the polyhedron itself in a combinatorial sense, but to output a planar “net” of it, meaning we must unfold its surface into the plane so that every face becomes a flat polygon in…
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › Open Udmurtia Junior Programming Contest 2018 ›

CF 105581K - Magic Chess Piece

We are working on a grid where each cell has a value computed deterministically from its coordinates. That value is taken modulo 4, and it decides how a chess piece behaves when it is currently standing on that cell.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › Open Udmurtia Junior Programming Contest 2018 ›

CF 105581C - File Manager

The input describes a directory structure through a list of file paths. Each path represents a file located somewhere inside a hierarchy of directories separated by slashes.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › Open Udmurtia Junior Programming Contest 2018 ›

CF 105581J - Origami

We start with a right isosceles triangular sheet of paper. Think of it as a 45-45-90 triangle. Vitya repeatedly folds this triangle along lines that split it into two congruent parts.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › Open Udmurtia Junior Programming Contest 2018 ›

CF 105581G - Robot Vacuum Cleaner

We are given an $N times M$ grid representing a room divided into square tiles. A robot starts at the top-left cell $(1,1)$ and repeatedly performs a very specific cleaning routine. Each cell, when visited, is marked as cleaned.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › Open Udmurtia Junior Programming Contest 2018 ›

CF 105581H - Amphitheater

We are given a theater whose seats form a triangular structure rather than a rectangle. The first row has a fixed number of seats, and each row below grows by two seats.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › Open Udmurtia Junior Programming Contest 2018 ›

CF 105581D - Mosquitoes

We are given a grid of size $N times M$. Each cell represents a window with an initial “brightness” value. That brightness does not just represent local effect, it acts as a source that sends mosquitoes to every window in the building, including itself.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › Open Udmurtia Junior Programming Contest 2018 ›

CF 105581A - Scanner

We are watching a process that can only start at discrete moments. Vitya visits a scanner periodically, every t minutes starting from time 0, and the day ends at time T.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › Open Udmurtia Junior Programming Contest 2018 ›

CF 105581I - Conflagration

We are given an n by n grid representing a square battlefield. Some cells are initially on fire, and the rest are empty. A knight starts on any empty cell and tries to escape by eventually moving outside the grid. Time progresses in discrete steps.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › Open Udmurtia Junior Programming Contest 2018 ›

CF 105581F - Equity

We are given an array of integers. In one move, we are allowed to pick a contiguous segment where all values are identical and increase every element in that segment by one.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › Open Udmurtia Junior Programming Contest 2018 ›

CF 105581B - Patrol

We are given a police officer who continuously patrols back and forth along a straight segment between two fixed points A and B at unit speed.
codeforces competitive-programming Jun 22, 2026