2010, Тренировка СГАУ aka Контест про маршрутки

8 problems from 2010, Тренировка СГАУ aka Контест про маршрутки (contest 102280), difficulty -. 8/8 solutions verified against sample I/O.

8 items

2010, Тренировка СГАУ aka Контест про маршрутки

Special | 8 problems | 8/8 verified | Difficulty - | 23m 6s

#	Problem	Time	✓
A	\u041a\u0430\u043c\u0435\u043d\u044c, \u043d\u043e\u0436\u043d\u0438\u0446\u044b, \u0431\u0443\u043c\u0430\u0433\u0430	2m 46s	✓
B	\u0421\u0443\u043c\u0430\u0441\u0448\u0435\u0434\u0448\u0438\u0435 \u0433\u043e\u043d\u043a\u0438 \u043d\u0430 \u043c\u0430\u0440\u0448\u0440\u0443\u0442\u043a\u0430\u0445	1m 39s	✓
C	\u042d\u043a\u0437\u0430\u043c\u0435\u043d \u043f\u043e \u0432\u043e\u0436\u0434\u0435\u043d\u0438\u044e	1m 28s	✓
D	\u0422\u0430\u0440\u0438\u0444\u0438\u043a\u0430\u0446\u0438\u044f	6m 7s	✓
E	\u0428\u0442\u0440\u0430\u0444	3m 9s	✓
F	\u041d\u0435\u043e\u0436\u0438\u0434\u0430\u043d\u043d\u0430\u044f \u0437\u0438\u043c\u0430	2m 26s	✓
G	\u0421\u043f\u0435\u0446\u0438\u0430\u043b\u044c\u043d\u044b\u0439 \u0437\u0430\u043a\u0430\u0437	2m 42s	✓
H	\u0417\u0430\u0434\u0430\u0447\u0430 \u0428\u0443\u043c\u0430\u0445\u0435\u0440\u0430	2m 49s	✓

Practice › Codeforces Solutions › 2010, Тренировка СГАУ aka Контест про маршрутки ›

CF 102280C - Экзамен по вождению

There are (n) drivers and (n) Gazelle cars. Each driver receives exactly one car, and every car is assigned to exactly one driver, so an assignment is a permutation of the cars. A driver is called fixed if they receive their own car.

Practice › Codeforces Solutions › 2010, Тренировка СГАУ aka Контест про маршрутки ›

CF 102280B - Сумасшедшие гонки на маршрутках

We have two independent minibuses. During the one-hour interval from 08:00 to 09:00, each minibus reaches the intersection exactly once, and its arrival time is uniformly distributed over the 3600 seconds of the hour. The traffic light starts with green at time 0.

Practice › Codeforces Solutions › 2010, Тренировка СГАУ aka Контест про маршрутки ›

CF 102280G - Специальный заказ

We have a starting point on a road and a destination somewhere away from that road. The straight-line distance between the starting point and the destination is s, while the perpendicular distance from the destination to the road is h.

Practice › Codeforces Solutions › 2010, Тренировка СГАУ aka Контест про маршрутки ›

CF 102280F - Неожиданная зима

Each line in the notebook contains only a driver's surname. A driver writes the surname once when leaving the garage and once when returning. The notebook does not tell us which occurrence is a departure and which is a return.

Practice › Codeforces Solutions › 2010, Тренировка СГАУ aka Контест про маршрутки ›

CF 102280H - Задача Шумахера

We are given two prime numbers, (p) and (q), and need to decide whether [ (p+1)^q ] is a perfect square. The numbers can contain up to (1000) decimal digits, so they are far beyond ordinary machine integer types.

Practice › Codeforces Solutions › 2010, Тренировка СГАУ aka Контест про маршрутки ›

CF 102280E - Штраф

We have a collection of individual banknotes. Each banknote has a denomination, and every banknote can be used at most once. Given a fine amount p, we need to choose some of the available banknotes whose total value is as small as possible while still being at least p.

Practice › Codeforces Solutions › 2010, Тренировка СГАУ aka Контест про маршрутки ›

CF 102280D - Тарификация

A route has a value k. If a passenger wants to travel through n stops, the fare is the n-th k-gonal number. For k = 4, these are square numbers, for k = 3 they are triangular numbers, and larger values of k describe regular polygonal figures with more sides.

Practice › Codeforces Solutions › 2010, Тренировка СГАУ aka Контест про маршрутки ›

CF 102280A - Камень, ножницы, бумага

We have n drivers, initially ordered by the positions they occupy in the log. The log is a single string of R, S, and P, but the boundaries between game rounds have been erased.