daw_9's blog

HAMSTERS, POI XVII
By daw_9, 11 years ago, In English

Hello. Could anybody provide me with a hint to solve this problem http://main.edu.pl/en/archive/oi/17/cho ? The problem gives you a set of N strings and then asks for the shortest string that has at least M occurrences of the strings. I'm unable to see a correct approach.

Thanks in advance.

  • Vote: I like it
  • +2
  • Vote: I do not like it

»
11 years ago, # |
  Vote: I like it +8 Vote: I do not like it

Think about matrix multiplication ...

→ Reply
  • »
    »
    11 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Thanks, that was a good hint :)

    → Reply