Codeforces Round 767 (Div. 2)

Solutions for Codeforces Round 767 (Div. 2) (contest 1629). 1/2 problems verified against sample I/O. Difficulty range: 800-800.

2 items

Codeforces Round 767 (Div. 2)

Type: Div. 2 | Problems: 2 | Verified: 1/2 | Rating range: 800-800 | Time: 2m 55s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Download More RAM	800	brute-force, greedy, sortings	1m 21s	✓
B	GCD Arrays	800	greedy, math, number-theory	1m 34s	✗

Practice › Codeforces Solutions › Codeforces Round 767 (Div. 2) ›

CF 1629B - GCD Arrays

We are given a continuous integer segment from $l$ to $r$, and we treat every number in this segment as an element of an array. The array is not arbitrary, it is fully determined by the interval, so its structure is very rigid.

Practice › Codeforces Solutions › Codeforces Round 767 (Div. 2) ›

CF 1629A - Download More RAM

We are asked to model a system where we can temporarily spend RAM to permanently increase RAM. Each software has two numbers: the amount of RAM it requires to run, and the amount of RAM it gives once used. Our PC starts with a certain initial RAM.