Codeforces Round 478 (Div. 2)

3 problems from Codeforces Round 478 (Div. 2) (contest 975), difficulty 900-2600. 3/3 solutions verified against sample I/O.

3 items

Codeforces Round 478 (Div. 2)

Div. 2 | 3 problems | 3/3 verified | Difficulty 900-2600 | 5m

# Problem Rating Tags Accepted Time ✓
A Aramic script 900 implementation, strings 10,276 1m 11s ✓
B Mancala 1100 brute-force, implementation 7,110 1m 23s ✓
E Hag's Khashba 2600 geometry 337 2m 26s ✓
Practice › Codeforces Solutions › Codeforces Round 478 (Div. 2) ›

CF 975E - Hag's Khashba

We are given a rigid strictly convex polygon with fixed geometry in the plane. Its vertices are labeled in order, and initially the polygon already sits in some stable position.
codeforces competitive-programming geometry Jun 17, 2026
Practice › Codeforces Solutions › Codeforces Round 478 (Div. 2) ›

CF 975B - Mancala

We are given a circular board with 14 positions. Each position contains some number of stones. One move consists of picking a single position that has stones, removing all stones from it, and then distributing those stones one by one into subsequent positions moving clockwise…
codeforces competitive-programming brute-force implementation Jun 17, 2026
Practice › Codeforces Solutions › Codeforces Round 478 (Div. 2) ›

CF 975A - Aramic script

Each word in the input is meant to describe an object, but the language has a normalization rule: two words represent the same object if they contain exactly the same set of distinct letters, ignoring how many times each letter appears and ignoring order.
codeforces competitive-programming implementation strings Jun 17, 2026