Codeforces Round 694 (Div. 2)

Solutions for Codeforces Round 694 (Div. 2) (contest 1471). 1/2 problems verified against sample I/O. Difficulty range: 900-1100.

2 items

Codeforces Round 694 (Div. 2)

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

Problem	Name	Rating	Tags	Solve Time	Verified
A	Strange Partition	900	greedy, math, number-theory	1m 31s	✓
B	Strange List	1100	brute-force, greedy, implementation	1m 39s	✗

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

CF 1471A - Strange Partition

We are given a sequence of positive integers, and we are allowed to repeatedly merge any two adjacent elements by replacing them with their sum. Every merge shortens the sequence by one element, but the total sum of all original values is preserved.

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

CF 1471B - Strange List

The process described in this problem is easier to understand if we think of the array as something that keeps expanding while being scanned from left to right. Every time we pick an element, we either expand it into smaller pieces or stop everything immediately.