Турнир Архимеда 2019

10 problems from Турнир Архимеда 2019 (contest 103664), difficulty -. 8/10 solutions verified against sample I/O.

10 items

Турнир Архимеда 2019

Special | 10 problems | 8/10 verified | Difficulty - | 10m 45s

# Problem Rating Tags Accepted Time ✓
A \u0421\u0442\u0438\u043a\u0435\u0440\u044b 48s ✓
B \u0411\u043e\u043b\u044c\u0448\u0438\u0435 \u044d\u043a\u0440\u0430\u043d\u044b 2m 9s
C \u0422\u0435\u0441\u0442 \u043d\u0430 \u0442\u0435\u0440\u043f\u0435\u043d\u0438\u0435 50s ✓
D \u041e\u0431\u043c\u0435\u043d 46s ✓
E \u041a\u0430\u0440\u0442\u043e\u0448\u043a\u0430 1m 3s ✓
F \u0421\u0431\u043e\u0440 \u0441\u0432\u0438\u0434\u0435\u0442\u0435\u043b\u044c\u0441\u043a\u0438\u0445 \u043f\u043e\u043a\u0430\u0437\u0430\u043d\u0438\u0439 44s ✓
G \u041e\u0431\u0435\u0434\u0435\u043d\u043d\u043e\u0435 \u0432\u0440\u0435\u043c\u044f 42s ✓
H \u0427\u0430\u0441\u043e\u0432\u0449\u0438\u043a 2m 11s
I \u0422\u0440\u0435\u0443\u0433\u043e\u043b\u044c\u043d\u044b\u0435 \u0447\u0438\u0441\u043b\u0430 46s ✓
J \u041e\u0431\u044a\u044f\u0432\u043b\u0435\u043d\u0438\u044f 46s ✓
Practice › Codeforces Solutions › Турнир Архимеда 2019 ›

CF 103664H - Часовщик

Let $G$ be the Cayley graph of $Sn$ with generating set $${sigma,tau}, qquad sigma = (1,2,dots,n), quad tau = (1,2),$$ where $n ge 3$ is odd.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › Турнир Архимеда 2019 ›

CF 103664J - Объявления

We are given a train route described as a sequence of stations in order along the line. Some subset of these stations are stopping points, while the rest are passed without stopping.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › Турнир Архимеда 2019 ›

CF 103664I - Треугольные числа

We are asked to construct a sequence of $n$ distinct positive integers such that any three chosen numbers from the sequence can form the side lengths of a non-degenerate triangle.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › Турнир Архимеда 2019 ›

CF 103664G - Обеденное время

We are given a current clock reading in 24-hour format and two limits, one allowing the clock to be shifted backward by at most a minutes and another allowing it to be shifted forward by at most b minutes.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › Турнир Архимеда 2019 ›

CF 103664F - Сбор свидетельских показаний

We are given a set of people who can potentially share information, represented as an undirected graph. Each person is a node, and an edge between two nodes means they are acquaintances. The detective calls people in a fixed order, from 1 to n.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › Турнир Архимеда 2019 ›

CF 103664B - Большие экраны

Let $G$ be the Cayley graph of $Sn$ with generating set $${sigma,tau}, qquad sigma = (1,2,dots,n), quad tau = (1,2),$$ where $n ge 3$ is odd.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › Турнир Архимеда 2019 ›

CF 103664E - Картошка

Two players, John and Paul, alternately say a word, starting with John. Each time a player speaks, they choose an integer strength within their personal range. John can choose any value from 1 up to $RJ$, and Paul from 1 up to $RP$.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › Турнир Архимеда 2019 ›

CF 103664D - Обмен

We are given a strictly increasing list of coin denominations, where each denomination divides the next one. This means the system behaves like a chained multiplicative structure rather than arbitrary coin values.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › Турнир Архимеда 2019 ›

CF 103664C - Тест на терпение

We are given several independent triples of integers. For each triple, we need to decide whether it is possible to construct two non-negative integers $x$ and $y$ such that three conditions hold simultaneously: their bitwise AND equals a given value $a$, their bitwise OR…
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › Турнир Архимеда 2019 ›

CF 103664A - Стикеры

We are given a rectangular board with sides a and b, placed in a fixed orientation so that its bottom edge is horizontal. Over k days, identical square stickers were placed one per day, each sticker also oriented so its bottom edge is horizontal.
codeforces competitive-programming Jul 2, 2026