2011, IV Самарская областная межвузовская олимпиада по программированию
13 problems from 2011, IV Самарская областная межвузовская олимпиада по программированию (contest 102281), difficulty -. 13/13 solutions verified against sample I/O.
2011, IV Самарская областная межвузовская олимпиада по программированию
Special | 13 problems | 13/13 verified | Difficulty - | 21m 36s
CF 102281B - Кулинарная задача
We have a triangular cookie cutter whose side lengths are (a), (b), and (c), and a circular cookie cutter with radius (r).
CF 102281C - Магическая задача
We are given the side length n of a square. The square must contain every integer from 1 through n² exactly once, with every row, every column, and both main diagonals having the same sum. The required output is only that common sum, not the square itself.
CF 102281K - Системная задача
У нас есть n установленных программ, пронумерованных от 1 до n. Для каждой программы известно, какие другие программы обязаны оставаться установленными в…
CF 102281L - Необычная задача
The function foo(a, b) repeatedly subtracts a from b until the current value becomes non-positive. The final value is zero exactly when a divides b. The function then recursively replaces a by 2a and 2a+1, so starting from a=1 it can eventually reach every positive integer.
CF 102281M - Антинаучная задача
The wormholes form a directed graph. Each known transition goes from one wormhole to another and has one of two costs. A hypertransition costs one ant-hour, while a null transition costs zero. The ship starts at wormhole 1 and has to reach wormhole n.
CF 102281J - Кольцевая задача
We have (n) separate chains. The (i)-th chain contains (ai) rings. An operation opens one ring, removes it from its original chain, and then closes that ring around the ends of two chains. The opened ring therefore becomes a connector between two pieces.
CF 102281I - Детская задача
We are given an addition written with words instead of digits, such as VOLVO+FIAT=MOTOR. Every distinct letter must be assigned a digit from 0 through 9. Two different letters must receive different digits, while every occurrence of the same letter receives the same digit.
CF 102281H - Спичечная задача
We have two matchboxes, each initially containing exactly n matches. Every time Professor X needs a match, he chooses one of the two pockets uniformly at random and tries to take a match from that box.
CF 102281G - Территориальная задача
We have an n × m rectangular grid of unit cells. Among these cells, k are marked as important. We need to count every axis-aligned rectangle of cells that contains all marked cells. There is one restriction: the chosen rectangle must not be the entire grid.
CF 102281F - Сложная задача
We have a collection of identical generators. The documentation says that exactly n generators produce k joules during m minutes. The required system must produce at least q joules during p minutes.
CF 102281E - Инновационная задача
We start with n repair robots and m independent nanodamages. During one second, every existing robot chooses exactly one action. It either repairs one damage, or spends the second creating one new robot. A newly created robot becomes available from the following second.
CF 102281D - Боевая задача
We have three points in three-dimensional space. The first point is the position of our spacecraft and laser cannon, the second is the center of an enemy spherical spacecraft together with its radius, and the third is the point selected by the targeting system.
CF 102281A - Простая задача
We have a single pile of n cookies. Two players remove cookies alternately, with Professor X moving first. A legal move removes p^k cookies, where p is prime and k is a nonnegative integer. Since k = 0 is allowed, removing exactly 1 cookie is always legal.