TeamsCode Summer 2024 Novice Division

11 problems from TeamsCode Summer 2024 Novice Division (contest 105283), difficulty -. 0/11 solutions verified against sample I/O.

11 items

TeamsCode Summer 2024 Novice Division

Special | 11 problems | 0/11 verified | Difficulty - | 16m 59s

# Problem Rating Tags Accepted Time ✓
A P!=NP 1m 27s
B Ifrit Tile 2 1m 23s
C Phonier 1m 58s
D Parallel Arrays 1m 32s
E Minimize Sum 1m 25s
F XOR Game 1m 49s
G Monkey Arrays 1m 33s
H Digit Removal 1m 27s
I Monkey Math Tree 1m 23s
J Kawaii the Rinbot 1m 20s
K Waymo orzorzorz 1m 42s
Practice › Codeforces Solutions › TeamsCode Summer 2024 Novice Division ›

CF 105283K - Waymo orzorzorz

We are building a text consisting of repeated copies of the string “orz”. The goal is to produce at least $N$ copies of this string in minimum time. At any moment, Jason has a current amount of text, and he can perform three actions.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › TeamsCode Summer 2024 Novice Division ›

CF 105283J - Kawaii the Rinbot

We are given a fixed external text file that lists anime titles, one per line. Each title is unique and appears exactly once in that file.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › TeamsCode Summer 2024 Novice Division ›

CF 105283I - Monkey Math Tree

We are given a path graph with nodes numbered from 1 to n, where each node i is independently kept with probability 1/i and removed otherwise.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › TeamsCode Summer 2024 Novice Division ›

CF 105283G - Monkey Arrays

We are given an array and three special values, with a strict ordering $Y < K < X$. For each test case, the task is to count how many contiguous subarrays satisfy three simultaneous conditions: the maximum element in the subarray is exactly $X$, the minimum element is exactly…
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › TeamsCode Summer 2024 Novice Division ›

CF 105283F - XOR Game

We are given a binary grid and we want to travel from the top-left cell to the bottom-right cell, only moving right or down. The restriction is that every visited cell must contain a 1.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › TeamsCode Summer 2024 Novice Division ›

CF 105283E - Minimize Sum

We are given an array of integers. One operation is allowed: pick any two elements, remove both, compute their bitwise XOR, and insert that result back into the array. This changes the array size by exactly minus one, since two elements are replaced by one.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › TeamsCode Summer 2024 Novice Division ›

CF 105283C - Phonier

We are given an array, and each query asks about all ordered pairs of indices inside a segment. For a query segment $[l, r]$, we take every pair $(i, j)$ in that range, compute $ai + aj$, and then XOR all of those results together.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › TeamsCode Summer 2024 Novice Division ›

CF 105283D - Parallel Arrays

We are given the numbers from 1 to 2n, and we must split them into two ordered lists a and b, each of length n, using every number exactly once.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › TeamsCode Summer 2024 Novice Division ›

CF 105283B - Ifrit Tile 2

We are given a rectangular grid where each cell is one of three types. Some cells are valid high ground positions where we can place a unit, some are low ground cells where enemies stand, and some cells are blocked and irrelevant for placement.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › TeamsCode Summer 2024 Novice Division ›

CF 105283H - Digit Removal

We are given a very large integer a and another integer b, both written as decimal strings. The number a has exactly four more digits than b.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › TeamsCode Summer 2024 Novice Division ›

CF 105283A - P!=NP

We are asked to count how many ordered pairs of integers $(n, p)$ satisfy a small set of constraints involving a product relationship between the two values. The value $p$ is chosen first and is restricted to the range $0 le p le P$.
codeforces competitive-programming Jun 23, 2026