Codeforces Round 846 (Div. 2)

Solutions for Codeforces Round 846 (Div. 2) (contest 1780). 3/6 problems verified against sample I/O. Difficulty range: 800-2400.

6 items

Codeforces Round 846 (Div. 2)

Type: Div. 2 | Problems: 6 | Verified: 3/6 | Rating range: 800-2400 | Time: 12m 59s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Hayato and School	800	constructive-algorithms, greedy	2m 8s	✗
B	GCD Partition	1100	brute-force, greedy, math	1m 37s	✓
D	Bit Guessing Game	1800	binary-search, bitmasks, constructive-algorithms	5m 21s	✗
E	Josuke and Complete Graph	2400	binary-search, brute-force, data-structures	54s	✗
F	Three Chairs	2300	bitmasks, brute-force, combinatorics	1m 16s	✓
G	Delicious Dessert	2400	binary-search, dsu, hashing	1m 43s	✓

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

CF 1780D - Bit Guessing Game

The problem presents a game where we must determine a hidden integer n using only the number of set bits (1s) in its binary representation. Initially, we know how many 1s n has. We can subtract any positive integer x from n as long as it does not exceed n.

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

CF 1780G - Delicious Dessert

We are given a string s of length n representing Tonio's dessert recipe. A substring of s is called delicious if the number of times it appears in s is divisible by its own length. The task is to count all delicious substrings of s, counting multiple occurrences separately.

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

CF 1780F - Three Chairs

We are asked to select three friends from a group of $n$ friends, each with a unique height, such that the smallest and largest heights among the chosen three are coprime. The input gives $n$ followed by an array of $n$ distinct integers representing the heights.

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

CF 1780E - Josuke and Complete Graph

Working

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

CF 1780A - Hayato and School

We are asked to find, in an array of integers, three distinct elements whose sum is odd. The input consists of multiple test cases, each providing the array. The output must indicate whether such a triple exists, and if it does, provide any valid set of three indices.

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

CF 1780B - GCD Partition

We are given an array of positive integers. Our task is to split this array into at least two contiguous subsegments, compute the sum of each subsegment, and then take the greatest common divisor (GCD) of these sums.