ТИИМ 2023-2024, Заключительный этап (8-9 классы)

0 problems from ТИИМ 2023-2024, Заключительный этап (8-9 классы) (contest 105101), difficulty -. 0/0 solutions verified against sample I/O.

6 items

ТИИМ 2023-2024, Заключительный этап (8-9 классы)

Special | 0 problems | 0/0 verified | Difficulty - |

#	Problem	Rating	Tags	Accepted	Time	✓
(none)

Practice › Codeforces Solutions › ТИИМ 2023-2024, Заключительный этап (8-9 классы) ›

CF 1051016 - Владелец банка

We are given several types of cars, where each type has a fixed number of available units and a fixed price per unit. These types are ordered, and the order matters when prices are equal: earlier types are preferred. Over multiple days, a buyer arrives with two constraints.

Practice › Codeforces Solutions › ТИИМ 2023-2024, Заключительный этап (8-9 классы) ›

CF 1051015 - Жизнь пешки

We are tracking the vertical movement history of a white pawn that starts on E2 and evolves over a fixed number of white moves. Only the rank matters, so the pawn’s state can be represented by an integer position from 2 to 8.

Practice › Codeforces Solutions › ТИИМ 2023-2024, Заключительный этап (8-9 классы) ›

CF 1051014 - Даня и тульские пряники

We are given several independent grids. Each grid represents a rectangular cake, where every cell contains an integer value describing its taste contribution.

Practice › Codeforces Solutions › ТИИМ 2023-2024, Заключительный этап (8-9 классы) ›

CF 1051011 - Доблесть и честь

We are given a set of warriors, each with a strength value we will call loyalty, and a set of enemy groups, each with a required strength. A single group of warriors, called a squad, is used to fight exactly one enemy group.

Practice › Codeforces Solutions › ТИИМ 2023-2024, Заключительный этап (8-9 классы) ›

CF 1051013 - Это магия

The magician’s trick reduces the task of identifying a hidden number between 1 and 100 into answering a fixed sequence of seven yes or no questions.

Practice › Codeforces Solutions › ТИИМ 2023-2024, Заключительный этап (8-9 классы) ›

CF 1051012 - Прямоугольные треугольники

We are given a set of points on the integer coordinate plane, and we need to count how many distinct triples of these points form a right-angled triangle.