IME++ Starters Try-Outs 2025

12 problems from IME++ Starters Try-Outs 2025 (contest 105968), difficulty -. 12/12 solutions verified against sample I/O.

12 items

IME++ Starters Try-Outs 2025

Special | 12 problems | 12/12 verified | Difficulty - | 11m 30s

#	Problem	Time	✓
A	Adding IQs	1m 1s	✓
B	Braga's Problem	54s	✓
C	Circulating Misinformation	51s	✓
D	Do The g, Man	1m 9s	✓
E	Escaping Cokeman	54s	✓
F	Fraud Detection	50s	✓
G	Gruesome Polynomials	1m 1s	✓
H	Heaviside Step Function	57s	✓
I	IME1000 project	52s	✓
J	Johannes Loves Games	1m 3s	✓
K	Kowtowing Our Leader	54s	✓
L	Legendary Duty Scheduler	1m 4s	✓

Practice › Codeforces Solutions › IME++ Starters Try-Outs 2025 ›

CF 105968L - Legendary Duty Scheduler

We are simulating a rotating duty assignment over a sequence of days. There is a fixed group of students, initially all present in an active pool. Over time, some students may be added to the pool and others may be removed, with these changes scheduled to happen on specific days.

Practice › Codeforces Solutions › IME++ Starters Try-Outs 2025 ›

CF 105968J - Johannes Loves Games

We are working with a dynamic array of integers where two kinds of operations are supported. One operation changes the value at a single position, and the other asks for information about a contiguous segment of the array.

Practice › Codeforces Solutions › IME++ Starters Try-Outs 2025 ›

CF 105968I - IME1000 project

The problem models a graph where traveling between cities is not only expensive in terms of edge weights, but also changes a secondary state called reputation. Each state of the system is described by a pair consisting of a node and a reputation value.

Practice › Codeforces Solutions › IME++ Starters Try-Outs 2025 ›

CF 105968H - Heaviside Step Function

The task presents a single number written in text form rather than as a native integer type. The number may be extremely large, beyond what standard integer types in most programming languages can store, so it must be processed as a raw string.

Practice › Codeforces Solutions › IME++ Starters Try-Outs 2025 ›

CF 105968G - Gruesome Polynomials

The task is about locating all real roots of a real-valued polynomial within a fixed interval, specifically from −30 to 30, with high precision.

Practice › Codeforces Solutions › IME++ Starters Try-Outs 2025 ›

CF 105968E - Escaping Cokeman

We are working on a grid-based shortest path problem where movement happens through a rectangular map. Each cell is either free or blocked by walls, and there are special cells: a starting point, a destination exit, and a badge location.

Practice › Codeforces Solutions › IME++ Starters Try-Outs 2025 ›

CF 105968D - Do The g, Man

We are working with an undirected graph. The task is to determine whether a very specific structure exists: a cycle of length four, and in addition to that cycle, a short “branch” of length two that starts from one vertex of the cycle but does not reuse the other vertices of…

Practice › Codeforces Solutions › IME++ Starters Try-Outs 2025 ›

CF 105968A - Adding IQs

We are given a collection of integer values representing IQs of individuals. The task is to count or characterize subsets of these values based on their total sum, where the direct interpretation is that every subset contributes a combined IQ equal to the sum of its elements.

Practice › Codeforces Solutions › IME++ Starters Try-Outs 2025 ›

CF 105968B - Braga's Problem

We are working with multiple queries over a range of integers, and for each query we need to compute the sum of all prime numbers that lie inside a given interval.

Practice › Codeforces Solutions › IME++ Starters Try-Outs 2025 ›

CF 105968K - Kowtowing Our Leader

We are given an array of integers, and we are interested in pairwise products formed by choosing two elements from it.

Practice › Codeforces Solutions › IME++ Starters Try-Outs 2025 ›

CF 105968F - Fraud Detection

We are given a collection of integers, each written in standard decimal form. The task is to look at each number, extract only its first non-zero digit, and count how often each digit from 0 to 9 appears as that leading digit across the entire collection.

Practice › Codeforces Solutions › IME++ Starters Try-Outs 2025 ›

CF 105968C - Circulating Misinformation

We are given two sequences of strings. The first sequence represents the original collection of messages, and the second sequence represents a later, potentially corrupted stream of messages.