h2. Restricţii
* $1 ≤ N ≤ 300 000$
* $1 ≤ M ≤ 4 500$
* $1 ≤ S ≤ 100$
* un caracter este definit ca fiind o literă mică din alfabetul englez
* un cuvânt poate apărea de mai multe ori
* prefixele cuvintelor pot fi doar concatenate, nu şi suprapuse
* $... ≤ ... ≤ ...$
h2. Exemplu
table(example). |_. enigma.in |_. enigma.out |
|7 3
xxxabdc
xxx
abdc
c
|8
| This is some
text written on
multiple lines.
| This is another
text written on
multiple lines.
|
h3. Explicaţie
Considerând numerotarea cuvintelor cea din fişierul de intare, perechile asociate poziţiilor primului cuvânt sunt:
$1. (1, 1) (1, 1) (1, 1) (2, 1) (2, 2) (2, 3) (2, 4);$
$2. (1, 1) (1, 2) (1, 1) (2, 1) (2, 2) (2, 3) (2, 4);$
$3. (1, 1) (1, 1) (1, 2) (2, 1) (2, 2) (2, 3) (2, 4);$
$4. (1, 1) (1, 2) (1, 3) (2, 1) (2, 2) (2, 3) (2, 4);$
$5. (1, 1) (1, 1) (1, 1) (2, 1) (2, 2) (2, 3) (3, 1);$
$6. (1, 1) (1, 2) (1, 1) (2, 1) (2, 2) (2, 3) (3, 1);$
$7. (1, 1) (1, 1) (1, 2) (2, 1) (2, 2) (2, 3) (3, 1);$
$8. (1, 1) (1, 2) (1, 3) (2, 1) (2, 2) (2, 3) (3, 1);$
...
== include(page="template/taskfooter" task_id="enigma") ==
