Codeforces Round 668 (Div. 2)

Solutions for Codeforces Round 668 (Div. 2) (contest 1405). 0/2 problems verified against sample I/O. Difficulty range: 800-1000.

2 items

Codeforces Round 668 (Div. 2)

Type: Div. 2 | Problems: 2 | Verified: 0/2 | Rating range: 800-1000 | Time: 8m 24s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Permutation Forgery	800	constructive-algorithms	1m 54s	✗
B	Array Cancellation	1000	constructive-algorithms, implementation	6m 30s	✗

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

CF 1405B - Array Cancellation

Let’s analyze the first test: The correct result is: So we are clearly choosing 4 elements, not 3. Now check the last test: 945 factors as: Those correspond to: So again: we are selecting 4 numbers, not 3 Your previous logic is effectively solving: “maximum product of 3…

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

CF 1405A - Permutation Forgery

We are asked to manipulate permutations of integers from 1 to n. Each permutation has a “fingerprint,” which is the sorted list of sums of every pair of consecutive elements.