Codeforces Round 739 (Div. 3)

7 problems from Codeforces Round 739 (Div. 3) (contest 1560), difficulty 800-2100. 2/7 solutions verified against sample I/O.

7 items

Codeforces Round 739 (Div. 3)

Div. 3 | 7 problems | 2/7 verified | Difficulty 800-2100 | 22m 8s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Dislike of Threes	800	implementation	73,483	1m 40s	✓
B	Who's Opposite?	800	math	38,794	2m 3s
C	Infinity Table	800	implementation, math	27,993	4m 6s
D	Make a Power of Two	1300	greedy, math, strings	19,457	2m 55s	✓
E	Polycarp and String Transformation	1800	binary-search, implementation, sortings	8,861	1m 49s
F1	Nearest Beautiful Number (easy version)	1900	binary-search, bitmasks, brute-force	6,759	7m 52s
F2	Nearest Beautiful Number (hard version)	2100	bitmasks, brute-force, constructive-algorithms	4,969	1m 43s

Practice › Codeforces Solutions › Codeforces Round 739 (Div. 3) ›

CF 1560C - Infinity Table

We are given a rule that fills an infinite grid with positive integers starting from 1. The placement does not proceed row by row or column by column in a simple linear fashion.

Practice › Codeforces Solutions › Codeforces Round 739 (Div. 3) ›

CF 1560F2 - Nearest Beautiful Number (hard version)

We are asked to construct, for each query, the smallest integer that is at least a given number n, under a digit-restriction constraint. The constraint is that the resulting number may use at most k distinct decimal digits in its representation, with no leading zeros allowed.

Practice › Codeforces Solutions › Codeforces Round 739 (Div. 3) ›

CF 1560B - Who's Opposite?

We are given three distinct labels that refer to people placed on a perfectly even circle. The circle size is even, but unknown, and the labels are not guaranteed to be consecutive or small.

Practice › Codeforces Solutions › Codeforces Round 739 (Div. 3) ›

CF 1560F1 - Nearest Beautiful Number (easy version)

We are given a starting number and a restriction on how many distinct digits we are allowed to use. For each query, we must find the smallest integer that is not smaller than the given number and whose decimal representation uses at most k different digits.

Practice › Codeforces Solutions › Codeforces Round 739 (Div. 3) ›

CF 1560D - Make a Power of Two

We are given a number written as a string of digits. In one operation, we are allowed to either remove any single digit from anywhere in the current string, or append a single digit to the right end of the string. These operations can be repeated in any order.

Practice › Codeforces Solutions › Codeforces Round 739 (Div. 3) ›

CF 1560E - Polycarp and String Transformation

We are given a string t which is generated from some original string s through a specific sequence of operations. Starting with an empty string t, Polycarp repeatedly appends the current s to t and then removes all occurrences of one chosen character from s.

Practice › Codeforces Solutions › Codeforces Round 739 (Div. 3) ›

CF 1560A - Dislike of Threes

We are asked to generate a sequence of positive integers that Polycarp "likes." A number is liked if it is not divisible by 3 and does not end with the digit 3. Given an integer $k$, the task is to output the $k$-th number in this sequence.