Codeforces Round 725 (Div. 3)

7 problems from Codeforces Round 725 (Div. 3) (contest 1538), difficulty 800-2100. 4/7 solutions verified against sample I/O.

7 items

Codeforces Round 725 (Div. 3)

Div. 3 | 7 problems | 4/7 verified | Difficulty 800-2100 | 33m 21s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Stone Game	800	brute-force, dp, greedy	40,398	3m 39s	✓
B	Friends and Candies	800	greedy, math	33,533	6m 40s	✓
C	Number of Pairs	1300	binary-search, data-structures, math	34,392	7m 6s
D	Another Problem About Dividing Numbers	1700	constructive-algorithms, math, number-theory	15,264	7m 9s
E	Funny Substrings	2100	data-structures, hashing, implementation	3,222	6m 39s	✓
F	Interesting Function	1500	binary-search, dp, math	22,213	1m 14s	✓
G	Gift Set	2100	binary-search, greedy, math	5,213	54s

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

CF 1538D - Another Problem About Dividing Numbers

We start with two numbers, and we are allowed to repeatedly “divide” either of them by some integer greater than one, as long as it divides cleanly.

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

CF 1538E - Funny Substrings

We are given a very small “programming language” where variables store strings. Each variable is either assigned a literal string of length at most five, or defined as the concatenation of two previously defined variables.

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

CF 1538F - Interesting Function

We are effectively watching a number grow from l to r by repeatedly adding one, and we want to measure how “violent” each increment is in terms of decimal digit changes.

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

CF 1538A - Stone Game

We are given a row of stones, each stone having a distinct strength value. In one move, we are allowed to remove only one of the two boundary stones, either the leftmost or the rightmost remaining stone.

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

CF 1538G - Gift Set

We have two piles of candies. One pile contains x red candies and the other contains y blue candies. Each gift set must use exactly a + b candies. There are two possible compositions: - a red and b blue - b red and a blue The two types are symmetric.

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

CF 1538C - Number of Pairs

We are given an array of integers and a range defined by two values, l and r. The task is to count all pairs of distinct indices (i, j) such that the sum of the elements at these indices lies within the given range, including the boundaries.

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

CF 1538B - Friends and Candies

We are given an array of integers representing how many candies each person initially holds. In a single operation, we are allowed to pick some subset of people, take all candies from them, and then freely redistribute those candies across everyone.