Codeforces Round 761 (Div. 2)

Solutions for Codeforces Round 761 (Div. 2) (contest 1617). 1/6 problems verified against sample I/O. Difficulty range: 800-2700.

6 items

Codeforces Round 761 (Div. 2)

Type: Div. 2 | Problems: 6 | Verified: 1/6 | Rating range: 800-2700 | Time: 16m 28s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Forbidden Subsequence	800	constructive-algorithms, greedy, sortings	1m 29s	✓
B	GCD Problem	900	brute-force, constructive-algorithms, math	1m 50s	✗
C	Paprika and Permutation	1300	binary-search, greedy, math	7m 42s	✗
D1	Too Many Impostors (easy version)	1800	constructive-algorithms, implementation, interactive	1m 39s	✗
D2	Too Many Impostors (hard version)	2400	constructive-algorithms, implementation, interactive	1m 54s	✗
E	Christmas Chocolates	2700	dfs-and-similar, dp, games	1m 54s	✗

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

CF 1617C - Paprika and Permutation

Your “actual output” is: That means the program likely: - crashed early, or - never entered the solve loop, or - mis-parsed the first token and exited silently Now look at the input: Your code almost certainly does: So it reads: Correct.

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

CF 1617E - Christmas Chocolates

We are given a box of chocolates, each with a distinct type represented by a non-negative integer. Icy wants to make at least one pair of chocolates have the same type, but before any exchanges, she chooses two chocolates, say at indices $x$ and $y$.

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

CF 1617D2 - Too Many Impostors (hard version)

We are given a group of n players, each labeled from 1 to n, where n is always a multiple of 3. Some of these players are impostors, and the rest are crewmates. We do not know the number of impostors k in advance, but we are guaranteed that it is strictly between n/3 and 2n/3.

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

CF 1617D1 - Too Many Impostors (easy version)

We are given a set of players, each of whom is either an impostor or a crewmate. The total number of players, $n$, is divisible by three.

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

CF 1617B - GCD Problem

We are asked to construct three distinct positive integers $a$, $b$, and $c$ such that their sum equals a given integer $n$ and the greatest common divisor of the first two numbers equals the third: $gcd(a, b) = c$.

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

CF 1617A - Forbidden Subsequence

We are given a string S of arbitrary lowercase letters and a string T that is always a permutation of "abc". The task is to rearrange the letters of S into a new string S' that is the lexicographically smallest possible while ensuring that T does not appear as a subsequence.