Codeforces Round 751 (Div. 2)

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

2 items

Codeforces Round 751 (Div. 2)

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

Problem	Name	Rating	Tags	Solve Time	Verified
A	Two Subsequences	800	implementation	1m 29s	✓
B	Divine Array	1100	constructive-algorithms, implementation	1m 14s	✓

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

CF 1602A - Two Subsequences

We are given a string s and asked to split it into two non-empty subsequences a and b such that every character of s belongs to exactly one of them. The additional requirement is that a must be the lexicographically smallest possible string we can form under this partition.

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

CF 1602B - Divine Array

We are given an array of integers where each element is between 1 and the size of the array. Over repeated steps, every element of the array is replaced by the count of how many times it occurs in the array.