Codeforces Round 146 (Div. 1)

Solutions for Codeforces Round 146 (Div. 1) (contest 235). 3/4 problems verified against sample I/O. Difficulty range: 1600-3000.

4 items

Codeforces Round 146 (Div. 1)

Type: Div. 1 | Problems: 4 | Verified: 3/4 | Rating range: 1600-3000 | Time: 11m 16s

Problem Name Rating Tags Solve Time Verified
A LCM Challenge 1600 number-theory 3m 2s ✓
C Cyclical Quest 2700 data-structures, string-suffix-structures, strings 2m 55s ✓
D Graph Game 3000 graphs 1m 37s ✗
E Number Challenge 2600 combinatorics, dp, implementation 3m 42s ✓
Practice › Codeforces Solutions › Codeforces Round 146 (Div. 1) ›

CF 235A - LCM Challenge

We are asked to choose three positive integers, each at most n, to maximize their least common multiple (LCM). The input is a single integer n, and the output is a single integer representing the largest possible LCM achievable using three integers not greater than n.
codeforces competitive-programming number-theory May 29, 2026
Practice › Codeforces Solutions › Codeforces Round 146 (Div. 1) ›

CF 235C - Cyclical Quest

We are given one large text string s, then many query strings x. For every query, we must count how many substrings of s are rotations of x. If x = "abcd", then all of these strings are considered equivalent: abcd, bcda, cdab, dabc.
codeforces competitive-programming data-structures string-suffix-structures strings May 29, 2026
Practice › Codeforces Solutions › Codeforces Round 146 (Div. 1) ›

CF 235D - Graph Game

We are given a connected graph with $n$ nodes and $n$ edges, meaning it is a single connected component with exactly one cycle.
codeforces competitive-programming graphs May 29, 2026
Practice › Codeforces Solutions › Codeforces Round 146 (Div. 1) ›

CF 235E - Number Challenge

We need to compute $$sum{i=1}^{a}sum{j=1}^{b}sum{k=1}^{c} d(i cdot j cdot k)$$ where $d(x)$ is the number of positive divisors of $x$.
codeforces competitive-programming combinatorics dp implementation math number-theory May 29, 2026