CodeTON Round 5 (Div. 1 + Div. 2, Rated, Prizes!)

Solutions for CodeTON Round 5 (Div. 1 + Div. 2, Rated, Prizes!) (contest 1842). 3/9 problems verified against sample I/O. Difficulty range: 800-3500.

9 items

CodeTON Round 5 (Div. 1 + Div. 2, Rated, Prizes!)

Type: Div. 1+2 | Problems: 9 | Verified: 3/9 | Rating range: 800-3500 | Time: 16m 2s

Problem Name Rating Tags Solve Time Verified
A Tenzing and Tsondu 800 games, math 58s ✗
B Tenzing and Books 1100 bitmasks, greedy, math 1m 45s ✓
C Tenzing and Balls 1500 dp 3m 10s ✗
D Tenzing and His Animal Friends 1900 constructive-algorithms, graphs, greedy 2m 3s ✗
E Tenzing and Triangle 2300 data-structures, dp, geometry 1m 45s ✓
F Tenzing and Tree 2500 dfs-and-similar, greedy, shortest-paths 2m 6s ✗
G Tenzing and Random Operations 2800 combinatorics, dp, math 1m 17s ✓
H Tenzing and Random Real Numbers 3000 bitmasks, dp, graphs 1m 55s ✗
I Tenzing and Necklace 3500 divide-and-conquer, dp, greedy 1m 3s ✗
Practice › Codeforces Solutions › CodeTON Round 5 (Div. 1 + Div. 2, Rated, Prizes!) ›

Practice › Codeforces Solutions › CodeTON Round 5 (Div. 1 + Div. 2, Rated, Prizes!) ›

CF 1842I - Tenzing and Necklace

The problem presents a circular necklace consisting of $n$ pearls, where each pearl is connected to its neighbor by a string, and the last pearl connects back to the first. Each string has a cost in minutes to cut.
codeforces competitive-programming divide-and-conquer dp greedy Jun 9, 2026
Practice › Codeforces Solutions › CodeTON Round 5 (Div. 1 + Div. 2, Rated, Prizes!) ›

CF 1842H - Tenzing and Random Real Numbers

We have $n$ independent random variables, each chosen uniformly from the interval $[0,1]$. Between pairs of variables we are given constraints of the form $$xi+xjle 1$$ or $$xi+xjge 1.$$ The task is to compute the probability that all constraints hold simultaneously.
codeforces competitive-programming bitmasks dp graphs math probabilities Jun 9, 2026
Practice › Codeforces Solutions › CodeTON Round 5 (Div. 1 + Div. 2, Rated, Prizes!) ›

CF 1842F - Tenzing and Tree

The proposed “solution” does not address the mathematical exercise at all. Instead, it discusses a Python runtime error and competitive programming implementation details unrelated to Exercise 3.3.1.
codeforces competitive-programming dfs-and-similar greedy shortest-paths sortings trees Jun 9, 2026
Practice › Codeforces Solutions › CodeTON Round 5 (Div. 1 + Div. 2, Rated, Prizes!) ›

CF 1842G - Tenzing and Random Operations

We are given an array where each element starts as a fixed value, and then we repeatedly apply a random “suffix increment” operation. In one operation we pick an index uniformly from the array, and we add a constant value v to every element from that index to the end.
codeforces competitive-programming combinatorics dp math probabilities Jun 9, 2026
Practice › Codeforces Solutions › CodeTON Round 5 (Div. 1 + Div. 2, Rated, Prizes!) ›

CF 1842C - Tenzing and Balls

We are given several test cases. Each test case starts with a line of integers representing a sequence of colored balls arranged in a row.
codeforces competitive-programming dp Jun 9, 2026
Practice › Codeforces Solutions › CodeTON Round 5 (Div. 1 + Div. 2, Rated, Prizes!) ›

CF 1842D - Tenzing and His Animal Friends

The proposed “solution” does not address the mathematical exercise at all. Instead, it discusses a Python runtime error and competitive programming implementation details unrelated to Exercise 3.3.1.
codeforces competitive-programming constructive-algorithms graphs greedy Jun 9, 2026
Practice › Codeforces Solutions › CodeTON Round 5 (Div. 1 + Div. 2, Rated, Prizes!) ›

CF 1842B - Tenzing and Books

We have three stacks of books. Each stack contains n books arranged from top to bottom. Every book has a non-negative integer written on it. Tenzing starts with knowledge equal to 0.
codeforces competitive-programming bitmasks greedy math Jun 9, 2026
Practice › Codeforces Solutions › CodeTON Round 5 (Div. 1 + Div. 2, Rated, Prizes!) ›

CF 1842A - Tenzing and Tsondu

The proposed “solution” does not address the mathematical exercise at all. Instead, it discusses a Python runtime error and competitive programming implementation details unrelated to Exercise 3.3.1.
codeforces competitive-programming games math Jun 9, 2026