Codeforces Round 637 (Div. 2) - Thanks, Ivan Belonogov!

2 problems from Codeforces Round 637 (Div. 2) - Thanks, Ivan Belonogov! (contest 1341), difficulty 900-1300. 1/2 solutions verified against sample I/O.

2 items

Codeforces Round 637 (Div. 2) - Thanks, Ivan Belonogov!

Div. 2 | 2 problems | 1/2 verified | Difficulty 900-1300 | 6m 52s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Nastya and Rice	900	math	30,424	1m 17s	✓
B	Nastya and Door	1300	greedy, implementation	21,091	5m 35s

Practice › Codeforces Solutions › Codeforces Round 637 (Div. 2) - Thanks, Ivan Belonogov! ›

CF 1341B - Nastya and Door

We are given an array of mountain heights. A “peak” is an index strictly inside a segment where the height is larger than both immediate neighbors, meaning it forms a local maximum. We are also given a fixed window length $k$, and we slide this window across the array.

Practice › Codeforces Solutions › Codeforces Round 637 (Div. 2) - Thanks, Ivan Belonogov! ›

CF 1341A - Nastya and Rice

We are given several independent scenarios about a bag of rice grains. In each scenario, there are two layers of uncertainty: the weight of each individual grain and the total weight of all grains together.