← All problemsSign in

Word Combinations

CSESString AlgorithmsOpen on judge ↗

You are given a string of length n and a dictionary containing k words. In how many ways can you create the string using the words? Input The first input line has a string containing n characters between a–z. The second line has an integer k: the number of words in the dictionary. Finally there are k lines describing the words. Each word is unique and consists of characters a–z. Output Print

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

Sign in to chat with the tutor and save your progress.

Sign in to start