Codeforces Round 604 (Div. 1)

6 problems from Codeforces Round 604 (Div. 1) (contest 1264), difficulty 1500-3500. 1/6 solutions verified against sample I/O.

6 items

Codeforces Round 604 (Div. 1)

Div. 1 | 6 problems | 1/6 verified | Difficulty 1500-3500 | 29m 53s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Beautiful Regional Contest	1500	greedy, implementation	10,440	6m 20s
B	Beautiful Sequence	1900	brute-force, constructive-algorithms, greedy	6,046	2m 35s
C	Beautiful Mirrors with queries	2400	data-structures, probabilities	1,322	10m 4s
D1	Beautiful Bracket Sequence (easy version)	2600	combinatorics, dp, probabilities	1,525	4m 15s
D2	Beautiful Bracket Sequence (hard version)	2900	combinatorics, probabilities	1,315	4m 55s
F	Beautiful Fibonacci Problem	3500	constructive-algorithms, number-theory	1,097	1m 44s	✓

Practice › Codeforces Solutions › Codeforces Round 604 (Div. 1) ›

CF 1264D2 - Beautiful Bracket Sequence (hard version)

We are given a string made of three possible characters: opening brackets, closing brackets, and wildcards. Each wildcard can independently become either type of bracket, so the input represents an entire family of binary choices, and therefore a family of bracket sequences.

Practice › Codeforces Solutions › Codeforces Round 604 (Div. 1) ›

CF 1264D1 - Beautiful Bracket Sequence (easy version)

We are given a string made of three types of characters: opening brackets, closing brackets, and wildcards. Each wildcard can independently be turned into either an opening or a closing bracket, so the input represents many possible concrete bracket strings.

Practice › Codeforces Solutions › Codeforces Round 604 (Div. 1) ›

CF 1264C - Beautiful Mirrors with queries

We are simulating a process that behaves like a probabilistic walk along a line of mirrors indexed from 1 to n. Each mirror i has an independent probability pi/100 of giving a successful response on any visit. If the response is successful, we advance to i + 1 on the next day.

Practice › Codeforces Solutions › Codeforces Round 604 (Div. 1) ›

CF 1264A - Beautiful Regional Contest

We are given a ranked list of contestants where higher-ranked participants always have at least as many solved problems as those below them. The task is to split a prefix of this ranking into three consecutive groups: gold, silver, and bronze, in that order.

Practice › Codeforces Solutions › Codeforces Round 604 (Div. 1) ›

CF 1264F - Beautiful Fibonacci Problem

We are given a small arithmetic sequence of positive integers: $a, a+d, a+2d, dots, a+(n-1)d$. The goal is to find another arithmetic sequence $b, b+e, b+2e, dots, b+(n-1)e$ such that the last 18 digits of the corresponding Fibonacci numbers contain the original numbers as…

Practice › Codeforces Solutions › Codeforces Round 604 (Div. 1) ›

CF 1264B - Beautiful Sequence

There is not enough information to diagnose the bug or provide a corrected solution. The sample with expected output appears to belong to a string construction problem, but you have not provided: - the problem statement, - the original Python solution, - or even the name of…