Codeforces Round 449 (Div. 1)

1 problems from Codeforces Round 449 (Div. 1) (contest 896), difficulty 1700-1700. 1/1 solutions verified against sample I/O.

1 items

Codeforces Round 449 (Div. 1)

Div. 1 | 1 problems | 1/1 verified | Difficulty 1700-1700 | 3m 28s

# Problem Rating Tags Accepted Time ✓
A Nephren gives a riddle 1700 binary-search, dfs-and-similar 3,793 3m 28s ✓
Practice › Codeforces Solutions › Codeforces Round 449 (Div. 1) ›

CF 896A - Nephren gives a riddle

The construction in this problem generates a sequence of strings where each level wraps the previous one inside a fixed template. The base string, call it $f0$, is a fixed sentence.
codeforces competitive-programming binary-search dfs-and-similar Jun 17, 2026