Олимпиада школьников РС(Я) (5-8 классы) 2022-23, 2 день

4 problems from Олимпиада школьников РС(Я) (5-8 классы) 2022-23, 2 день (contest 104159), difficulty -. 3/4 solutions verified against sample I/O.

4 items

Олимпиада школьников РС(Я) (5-8 классы) 2022-23, 2 день

Special | 4 problems | 3/4 verified | Difficulty - | 5m

#	Problem	Time	✓
E	\u0412\u0435\u0440\u0441\u0442\u043e\u0432\u044b\u0435 \u0441\u0442\u043e\u043b\u0431\u044b	59s	✓
F	Wordland	1m 4s	✓
G	\u041f\u043e\u0433\u043e\u043d\u044f, \u043f\u043e\u0433\u043e\u043d\u044f, \u043f\u043e\u0433\u043e\u043d\u044f	1m 37s	✓
H	\u041d\u0435\u043f\u0440\u043e\u0441\u0442\u044b\u0435 \u043e\u0442\u043d\u043e\u0448\u0435\u043d\u0438\u044f \u043c\u0435\u0436\u0434\u0443 \u0447\u0438\u0441\u043b\u0430\u043c\u0438	1m 20s

Practice › Codeforces Solutions › Олимпиада школьников РС(Я) (5-8 классы) 2022-23, 2 день ›

CF 104159H - Непростые отношения между числами

We are given a prefix of natural numbers from 1 up to some limit $n$, and we want to choose as many of them as possible under a single restriction.

Practice › Codeforces Solutions › Олимпиада школьников РС(Я) (5-8 классы) 2022-23, 2 день ›

CF 104159G - Погоня, погоня, погоня

Two trucks move along a straight road made of five consecutive segments. Each segment has a fixed length, and two of these segments are “bad road” segments where movement becomes slower for both vehicles.

Practice › Codeforces Solutions › Олимпиада школьников РС(Я) (5-8 классы) 2022-23, 2 день ›

CF 104159F - Wordland

We are given several short strings made of lowercase English letters. For each string, we need to decide whether it is “valid” under a rule that depends on how letters alternate between two classes: vowels and consonants. The rule is applied after a preprocessing step.

Practice › Codeforces Solutions › Олимпиада школьников РС(Я) (5-8 классы) 2022-23, 2 день ›

CF 104159E - Верстовые столбы

We are given a positive integer $N$. We need to construct the smallest positive integer that satisfies two conditions at the same time: it must be divisible by $N$, and its decimal representation must end in the digit zero. Ending in zero means the number is a multiple of 10.