Codeforces Round 107 (Div. 1)

Solutions for Codeforces Round 107 (Div. 1) (contest 150). 4/5 problems verified against sample I/O. Difficulty range: 1400-3000.

5 items

Codeforces Round 107 (Div. 1)

Type: Div. 1 | Problems: 5 | Verified: 4/5 | Rating range: 1400-3000 | Time: 11m 8s

Problem Name Rating Tags Solve Time Verified
A Win or Freeze 1400 games, math, number-theory 2m 2s ✗
B Quantity of Strings 1600 combinatorics, dfs-and-similar, graphs 1m 40s ✓
C Smart Cheater 2200 data-structures, math, probabilities 2m 11s ✓
D Mission Impassable 2600 dp, strings 2m 26s ✓
E Freezing with Style 3000 binary-search, data-structures, divide-and-conquer 2m 49s ✓
Practice › Codeforces Solutions › Codeforces Round 107 (Div. 1) ›

CF 150A - Win or Freeze

We start with a number q written on paper. On each turn, a player must replace the current number with one of its non-trivial divisors, meaning a divisor strictly between 1 and the number itself. If a player cannot make a move, that player wins immediately.
codeforces competitive-programming games math number-theory May 29, 2026
Practice › Codeforces Solutions › Codeforces Round 107 (Div. 1) ›

CF 150B - Quantity of Strings

We want to count strings of length n built from an alphabet of size m, under one strong restriction: every substring of length k must be a palindrome.
codeforces competitive-programming combinatorics dfs-and-similar graphs math May 29, 2026
Practice › Codeforces Solutions › Codeforces Round 107 (Div. 1) ›

CF 150C - Smart Cheater

We have a straight bus route with fixed stop coordinates. A passenger normally pays the full distance between their boarding and exit stops. The conductor is allowed to "hide" at most one continuous segment of that trip from the ticket.
codeforces competitive-programming data-structures math probabilities May 29, 2026
Practice › Codeforces Solutions › Codeforces Round 107 (Div. 1) ›

CF 150D - Mission Impassable

We start with a string of length l. In one move we may choose any contiguous substring that is a palindrome and whose length k is allowed, meaning a[k] != -1. After deleting it, the remaining characters concatenate together. The score gained from this move is a[k].
codeforces competitive-programming dp strings May 29, 2026
Practice › Codeforces Solutions › Codeforces Round 107 (Div. 1) ›

CF 150E - Freezing with Style

We are given a tree with n junctions and n - 1 roads. Every road has an integer beauty value. We must choose two junctions so that the path between them contains between l and r edges inclusive.
codeforces competitive-programming binary-search data-structures divide-and-conquer trees May 29, 2026