Codeforces Round 107 (Div. 1)

5 problems from Codeforces Round 107 (Div. 1) (contest 150), difficulty 1400-3000. 4/5 solutions verified against sample I/O.

5 items

Codeforces Round 107 (Div. 1)

Div. 1 | 5 problems | 4/5 verified | Difficulty 1400-3000 | 11m 8s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Win or Freeze	1400	games, math, number-theory	8,591	2m 2s
B	Quantity of Strings	1600	combinatorics, dfs-and-similar, graphs	5,314	1m 40s	✓
C	Smart Cheater	2200	data-structures, math, probabilities	746	2m 11s	✓
D	Mission Impassable	2600	dp, strings	738	2m 26s	✓
E	Freezing with Style	3000	binary-search, data-structures, divide-and-conquer	1,034	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.

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.

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.

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].

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.