Codeforces Round 662 (Div. 2)

Solutions for Codeforces Round 662 (Div. 2) (contest 1393). 3/6 problems verified against sample I/O. Difficulty range: 800-3200.

6 items

Codeforces Round 662 (Div. 2)

Type: Div. 2 | Problems: 6 | Verified: 3/6 | Rating range: 800-3200 | Time: 23m 16s

Problem Name Rating Tags Solve Time Verified
A Rainbow Dash, Fluttershy and Chess Coloring 800 greedy, math 1m 21s ✓
B Applejack and Storages 1400 constructive-algorithms, data-structures, greedy 5m 14s ✗
C Pinkie Pie Eats Patty-cakes 1700 constructive-algorithms, greedy, math 11m 2s ✓
D Rarity and New Dress 2100 dfs-and-similar, dp, implementation 1m 22s ✓
E1 Twilight and Ancient Scroll (easier version) 2800 dp, hashing, implementation 1m 57s ✗
E2 Twilight and Ancient Scroll (harder version) 3200 dp, hashing, implementation 2m 20s ✗
Practice › Codeforces Solutions › Codeforces Round 662 (Div. 2) ›

CF 1393C - Pinkie Pie Eats Patty-cakes

We are given a multiset of patty-cakes represented by integers. Equal integers mean equal fillings. We may choose any order in which to eat them. For every filling that appears multiple times, we can look at the distances between consecutive occurrences in the eating order.
codeforces competitive-programming constructive-algorithms greedy math sortings Jun 11, 2026
Practice › Codeforces Solutions › Codeforces Round 662 (Div. 2) ›

CF 1393E2 - Twilight and Ancient Scroll (harder version)

We are given a sequence of words that are supposed to represent an already sorted “original scroll”. The original property is that if you read the words from top to bottom, they are in non-decreasing lexicographic order.
codeforces competitive-programming dp hashing implementation string-suffix-structures strings two-pointers Jun 11, 2026
Practice › Codeforces Solutions › Codeforces Round 662 (Div. 2) ›

CF 1393B - Applejack and Storages

Applejack wants to build two storages using planks from a storehouse: one square and one rectangle. Each side of a storage uses exactly one plank, so a square requires four planks of the same length and a rectangle requires two pairs of equal-length planks.
codeforces competitive-programming constructive-algorithms data-structures greedy implementation Jun 11, 2026
Practice › Codeforces Solutions › Codeforces Round 662 (Div. 2) ›

CF 1393E1 - Twilight and Ancient Scroll (easier version)

We are given a sequence of words that is supposed to come from an originally sorted list, where the original list was non-decreasing in lexicographic order.
codeforces competitive-programming dp hashing implementation string-suffix-structures strings Jun 11, 2026
Practice › Codeforces Solutions › Codeforces Round 662 (Div. 2) ›

CF 1393D - Rarity and New Dress

We are given a grid of characters where each cell represents a colored tile. From this grid we want to count how many “valid dress patterns” exist.
codeforces competitive-programming dfs-and-similar dp implementation shortest-paths Jun 11, 2026
Practice › Codeforces Solutions › Codeforces Round 662 (Div. 2) ›

CF 1393A - Rainbow Dash, Fluttershy and Chess Coloring

We are given a square grid of size $n times n$. The goal is to completely cover every cell with two colors in a chessboard pattern, meaning adjacent cells must always have opposite colors.
codeforces competitive-programming greedy math Jun 11, 2026