Codeforces Round 604 (Div. 2)

Solutions for Codeforces Round 604 (Div. 2) (contest 1265). 1/2 problems verified against sample I/O. Difficulty range: 1000-2100.

2 items

Codeforces Round 604 (Div. 2)

Type: Div. 2 | Problems: 2 | Verified: 1/2 | Rating range: 1000-2100 | Time: 4m

Problem	Name	Rating	Tags	Solve Time	Verified
A	Beautiful String	1000	constructive-algorithms, greedy	1m 25s	✓
E	Beautiful Mirrors	2100	data-structures, dp, math	2m 35s	✗

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

CF 1265E - Beautiful Mirrors

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…

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

CF 1265A - Beautiful String

We are given several independent strings, each consisting of the characters a, b, c, and ?. The task is to replace every ? with one of the letters a, b, or c so that the final string has no two equal adjacent characters.