Grammar Distance

CodeChefOpen on judge ↗

You are given a context free grammar $G$ and a string $S$. Find the minimum Levenshtein distance between $S$ and any string $W$ accepted by $G$. ### Input - The first line of the input contains two space-separated integers $V$ and $R$ denoting the number of *non-terminals* and the number of *productions* of $G$ respectively. - The following $R$ lines describe productions. - Each line starts with

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI