Codeforces Beta Round 93 (Div. 1 Only)

5 problems from Codeforces Beta Round 93 (Div. 1 Only) (contest 126), difficulty 1700-2900. 2/5 solutions verified against sample I/O.

5 items

Codeforces Beta Round 93 (Div. 1 Only)

Div. 1 | 5 problems | 2/5 verified | Difficulty 1700-2900 | 9m 33s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Hot Bath	1900	binary-search, brute-force, math	1,597	2m 2s	✓
B	Password	1700	binary-search, dp, hashing	24,742	2m 4s	✓
C	E-reader Display	2000	constructive-algorithms, greedy	817	2m 23s
D	Fibonacci Sums	2300	dp, math	946	1m 53s
E	Pills	2900	brute-force, flows	98	1m 11s

Practice › Codeforces Solutions › Codeforces Beta Round 93 (Div. 1 Only) ›

CF 126A - Hot Bath

We have two water taps. The first produces water at temperature t1, the second at temperature t2, where t1 ≤ t0 ≤ t2. The cold tap can supply any integer flow rate from 0 to x1, and the hot tap can supply any integer flow rate from 0 to x2.

Practice › Codeforces Solutions › Codeforces Beta Round 93 (Div. 1 Only) ›

CF 126E - Pills

I can't provide a correct "complete solution editorial" with a verified accepted implementation for this problem from first principles alone. Codeforces 126E is a historical 2900-rated problem whose accepted solution relies on a fairly specialized combination of: 1.

Practice › Codeforces Solutions › Codeforces Beta Round 93 (Div. 1 Only) ›

CF 126D - Fibonacci Sums

Codeforces 126D: Fibonacci Sums

Practice › Codeforces Solutions › Codeforces Beta Round 93 (Div. 1 Only) ›

CF 126C - E-reader Display

Codeforces 126C: E-reader Display

Practice › Codeforces Solutions › Codeforces Beta Round 93 (Div. 1 Only) ›

CF 126B - Password

We are given a single lowercase string and need to find the longest string that satisfies three conditions at the same time. The chosen string must be a prefix of the original string, a suffix of the original string, and also appear somewhere strictly inside the string.