TheForces Round #27(3^3-Forces)

6 problems from TheForces Round #27(3^3-Forces) (contest 104855), difficulty -. 0/6 solutions verified against sample I/O.

6 items

TheForces Round #27(3^3-Forces)

Special | 6 problems | 0/6 verified | Difficulty - | 9m 35s

#	Problem	Time
A	GCD,LCM and AVG	1m 32s
B	Yugandhar's Letter for Diya	1m 37s
C	Hungry Shark	1m 31s
D	Colorful Paths	1m 24s
E	Perfect Permutation	1m 28s
F	Regular Covering	2m 3s

Practice › Codeforces Solutions › TheForces Round #27(3^3-Forces) ›

CF 104855F - Regular Covering

We are given a set of points on the plane and a regular polygon with a fixed number of sides $m$. The polygon is always centered at the origin, but we are free to rotate it.

Practice › Codeforces Solutions › TheForces Round #27(3^3-Forces) ›

CF 104855E - Perfect Permutation

We are given three arrays of equal length, and our task is to build a permutation of indices from 1 to n. For each position i, the value assigned to that position in the permutation determines which of three rewards we collect at i.

Practice › Codeforces Solutions › TheForces Round #27(3^3-Forces) ›

CF 104855D - Colorful Paths

We are given a directed graph where each edge carries a label called a color. Starting from node 1, we can walk along directed edges as many times as we want, and we are allowed to revisit nodes and reuse edges.

Practice › Codeforces Solutions › TheForces Round #27(3^3-Forces) ›

CF 104855B - Yugandhar's Letter for Diya

We are given a very large rectangular grid. One cell is initially blue, and we are allowed to choose exactly $k$ additional cells and paint them pink. After this setup, two spreading processes take place alternately.

Practice › Codeforces Solutions › TheForces Round #27(3^3-Forces) ›

CF 104855A - GCD,LCM and AVG

We are interacting with a hidden integer $x$ between $1$ and $10^9$. Our only tool is to ask queries of the form “give me some integer $a$” and receive back a value computed from how $a$ relates to $x$.

Practice › Codeforces Solutions › TheForces Round #27(3^3-Forces) ›

CF 104855C - Hungry Shark

We are given a circular arrangement of boxes, each containing some number of identical items. A person starts at the first box and repeatedly performs a fixed routine: if the current box still has items, she removes exactly one item and increases a running counter, then she…