Codeforces Round 629 (Div. 3)

5 problems from Codeforces Round 629 (Div. 3) (contest 1328), difficulty 800-2200. 0/5 solutions verified against sample I/O.

5 items

Codeforces Round 629 (Div. 3)

Div. 3 | 5 problems | 0/5 verified | Difficulty 800-2200 | 19m 2s

# Problem Rating Tags Accepted Time ✓
A Divisibility Problem 800 math 131,841 5m 25s
C Ternary XOR 1200 greedy, implementation 33,077 3m 1s
D Carousel 1800 constructive-algorithms, dp, graphs 14,523 3m 4s
E Tree Queries 1900 dfs-and-similar, graphs, trees 11,706 1m 27s
F Make k Equal 2200 greedy 3,524 6m 5s
Practice › Codeforces Solutions › Codeforces Round 629 (Div. 3) ›

CF 1328F - Make k Equal

Codeforces 1328F: Make k Equal
codeforces competitive-programming greedy Jun 16, 2026
Practice › Codeforces Solutions › Codeforces Round 629 (Div. 3) ›

CF 1328D - Carousel

We are given a circular arrangement of positions, each holding an animal type. The positions are connected in a cycle, so after the last position comes the first again. We must assign a color to each position.
codeforces competitive-programming constructive-algorithms dp graphs greedy math Jun 16, 2026
Practice › Codeforces Solutions › Codeforces Round 629 (Div. 3) ›

CF 1328C - Ternary XOR

We are given a ternary string x, meaning each position is a digit among 0, 1, or 2. The task is to split this single number into two ternary numbers a and b, both of the same length as x, such that if we add them digit by digit modulo 3, we recover x.
codeforces competitive-programming greedy implementation Jun 16, 2026
Practice › Codeforces Solutions › Codeforces Round 629 (Div. 3) ›

CF 1328A - Divisibility Problem

Each test case contains two positive integers. We may only perform one kind of operation: increase the first number by one.
codeforces competitive-programming math Jun 11, 2026
Practice › Codeforces Solutions › Codeforces Round 629 (Div. 3) ›

CF 1328E - Tree Queries

The solution does not successfully establish what Exercise 4.6.3.13 asks. The positive part is that the displayed constructions are now genuine star chains.
codeforces competitive-programming dfs-and-similar graphs trees Jun 11, 2026