Codeforces Round 706 (Div. 2)

Solutions for Codeforces Round 706 (Div. 2) (contest 1496). 0/2 problems verified against sample I/O. Difficulty range: 900-1100.

2 items

Codeforces Round 706 (Div. 2)

Type: Div. 2 | Problems: 2 | Verified: 0/2 | Rating range: 900-1100 | Time: 9m 57s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Split it!	900	brute-force, constructive-algorithms, greedy	5m 26s	✗
B	Max and Mex	1100	math	4m 31s	✗

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

CF 1496A - Split it!

We are given a string s and a number k. The task is to decide whether we can split s into 2k+1 consecutive parts with a very specific symmetry constraint. The first k+1 pieces are arbitrary non-empty strings a1, a2, ..., a(k+1).

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

CF 1496B - Max and Mex

We are given a multiset of distinct non-negative integers and need to simulate a process where, up to k times, we add the element (mex + max + 1) // 2 to the multiset. The mex of a set is the smallest non-negative integer not present, and max is the largest element.