Codeforces Round 808 (Div. 2)

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

2 items

Codeforces Round 808 (Div. 2)

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

Problem	Name	Rating	Tags	Solve Time	Verified
A	Difference Operations	800	greedy, math	2m 2s	✓
B	Difference of GCDs	1100	constructive-algorithms, math	8m 28s	✗

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

CF 1708B - Difference of GCDs

We are given: - $n = 7$, $q = 6$ - array: - queries: So: - queries are 1-indexed - queries may be reversed (we see (7,1), (4,2)), so we must normalize - each query produces a single integer The incorrect output: is a strong sign of this failure mode: The code computed a single…

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

CF 1708A - Difference Operations

We are given an array of positive integers. The only allowed operation chooses some position i 1 and replaces a[i] with a[i] - a[i-1]. The operation affects only one element, and it always subtracts the current value immediately to its left.