Codeforces Round 275 (Div. 1)

Solutions for Codeforces Round 275 (Div. 1) (contest 482). 0/4 problems verified against sample I/O. Difficulty range: 1200-3200.

4 items

Codeforces Round 275 (Div. 1)

Type: Div. 1 | Problems: 4 | Verified: 0/4 | Rating range: 1200-3200 | Time: 23m 24s

Problem Name Rating Tags Solve Time Verified
A Diverse Permutation 1200 constructive-algorithms, greedy 11m 3s ✗
C Game with Strings 2600 bitmasks, dp, probabilities 1m 44s ✗
D Random Function and Tree 2700 combinatorics, dp, trees 5m 18s ✗
E ELCA 3200 data-structures, trees 5m 19s ✗
Practice › Codeforces Solutions › Codeforces Round 275 (Div. 1) ›

CF 482A - Diverse Permutation

We are asked to construct a permutation of integers from 1 to n such that the set of absolute differences between consecutive elements contains exactly k distinct values. Concretely, if the permutation is [p1, p2, ...
codeforces competitive-programming constructive-algorithms greedy May 31, 2026
Practice › Codeforces Solutions › Codeforces Round 275 (Div. 1) ›

CF 482C - Game with Strings

We are given a collection of distinct strings of the same length. One string is secretly chosen uniformly at random. Our goal is to determine the expected number of questions needed to identify the chosen string.
codeforces competitive-programming bitmasks dp probabilities May 31, 2026
Practice › Codeforces Solutions › Codeforces Round 275 (Div. 1) ›

CF 482D - Random Function and Tree

Codeforces 482D: Random Function and Tree
codeforces competitive-programming combinatorics dp trees May 31, 2026
Practice › Codeforces Solutions › Codeforces Round 275 (Div. 1) ›

CF 482E - ELCA

Codeforces 482E: ELCA
codeforces competitive-programming data-structures trees May 31, 2026