Codeforces Round 118 (Div. 1)

Solutions for Codeforces Round 118 (Div. 1) (contest 185). 3/4 problems verified against sample I/O. Difficulty range: 1300-2600.

4 items

Codeforces Round 118 (Div. 1)

Type: Div. 1 | Problems: 4 | Verified: 3/4 | Rating range: 1300-2600 | Time: 6m 44s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Plant	1300	math	1m 38s	✓
B	Mushroom Scientists	1800	math, ternary-search	1m 19s	✓
C	Clever Fat Rat	2500	dp	1m 25s	✓
D	Visit of the Great	2600	math, number-theory	2m 22s	✗

Practice › Codeforces Solutions › Codeforces Round 118 (Div. 1) ›

CF 185A - Plant

We start with exactly one upward-pointing triangle. Every year, each triangle splits into four smaller triangles. Three of them keep the same orientation as the parent, while one flips direction. The input gives the number of years n.

Practice › Codeforces Solutions › Codeforces Round 118 (Div. 1) ›

CF 185B - Mushroom Scientists

We are asked to find a point in three-dimensional space, with non-negative coordinates, such that the sum of the coordinates does not exceed a given value $S$.

Practice › Codeforces Solutions › Codeforces Round 118 (Div. 1) ›

CF 185C - Clever Fat Rat

We have a triangular pyramid of scales. The top row has n scales, the second row has n-1, the third has n-2, down to the last row with a single scale. Each scale has a maximum weight it can hold without breaking. Initially, each top-row scale receives a certain amount of cereal.

Practice › Codeforces Solutions › Codeforces Round 118 (Div. 1) ›

CF 185D - Visit of the Great

We are given many queries. In each query, we take all numbers of the form $$k^{2l}+1, k^{2l+1}+1, dots, k^{2r}+1$$ and must compute their least common multiple modulo a prime $p$. The interval length can be enormous because $r$ may reach $10^{18}$.