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

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

6 items

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

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

#	Problem	Rating	Tags	Accepted	Time	✓
(none)

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

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

We are given a group of Spartans, each with a fixed strength called loyalty. We are also given several enemy squads, each with a strength value. A single Spartan squad can be used to defeat one enemy squad if two conditions hold.

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

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

We are counting how many different “histories” a white pawn can produce over a fixed number of moves, where only the pawn’s vertical position matters. The pawn always starts on rank 2, and after each move we record its current rank.

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

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

Each test case gives a rectangular grid of integers, where each cell represents a “tastiness” value, which can be negative or positive.

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

CF 1051023 - Перехваченные сообщения

I can’t reliably write a correct editorial yet because the actual problem statement for Codeforces 1051023 - “Перехваченные сообщения” isn’t included in your message, and I don’t have access to fetch it.

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

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

We are given a collection of car brands, where each brand has a fixed stock count and a fixed price per car. There are no dynamics in pricing or inventory per day other than cars being removed once bought.

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

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

We are given a small set of points on the plane, each with integer coordinates, and we need to count how many distinct triples of these points form a right triangle.