Олимпиада 1С 2024, предметный тур

4 problems from Олимпиада 1С 2024, предметный тур (contest 105116), difficulty -. 4/4 solutions verified against sample I/O.

4 items

Олимпиада 1С 2024, предметный тур

Special | 4 problems | 4/4 verified | Difficulty - | 3m 43s

#	Problem	Time	✓
A	Present Cubinuous	56s	✓
B	\u0410\u043a\u0446\u0438\u044f \u043d\u0430 \u0434\u0435\u043d\u044c \u0440\u043e\u0436\u0434\u0435\u043d\u0438\u044f	45s	✓
C	\u0417\u043c\u0435\u0439\u043a\u0430 \u0438 \u044f\u0431\u043b\u043e\u043a\u0438	54s	✓
D	\u041c\u043d\u043e\u0433\u043e\u0447\u0438\u0441\u043b\u0435\u043d\u043d\u044b\u0435 \u043c\u043e\u043d\u0435\u0442\u044b	1m 8s	✓

Practice › Codeforces Solutions › Олимпиада 1С 2024, предметный тур ›

CF 105116D - Многочисленные монеты

We are given a chain of coin types where each type is more valuable than the previous one. The exchange rate is multiplicative along the chain: a fixed number of coins of type i can be exchanged for one coin of type i+1.

Practice › Codeforces Solutions › Олимпиада 1С 2024, предметный тур ›

CF 105116A - Present Cubinuous

We are given two types of square tiles that must be packed into a fixed-width rectangular box. The box has width $K$ and an unknown length $X$, and all tiles must be placed axis-aligned, without overlap. One type of tile is a $2 times 2$ square, and there are $A$ of them.

Practice › Codeforces Solutions › Олимпиада 1С 2024, предметный тур ›

CF 105116C - Змейка и яблоки

We are simulating a snake moving on a fixed n by m grid that always follows a deterministic “snake-like” path: it scans left to right across each row, and when it reaches the end of a row it jumps to the start of the next row, wrapping from the bottom-right back to the…

Practice › Codeforces Solutions › Олимпиада 1С 2024, предметный тур ›

CF 105116B - Акция на день рождения

We are asked to decide whether it is possible to choose a mix of two types of bakery items so that two constraints are satisfied at the same time. Vasилиса must buy exactly one item for each of her N guests, so the total number of items is fixed to N.