Eddagdeg's blog

By Eddagdeg, history, 4 years ago, In English

Hello I'm trying to solve this question using Aho-corasick tree:how to Find the lexicographically smallest string of a given length that doesn't match any given strings !I'm stuck and I cannot implement that :( any help will be appreciated ^__^ and Thanks!

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

»
4 years ago, # |
  Vote: I like it 0 Vote: I do not like it

This sounds like two different pieces: build-min-lex-string and match it with given. What part are you stuck on?

»
4 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Post the problem link. A) to give people more info, and B) so nobody thinks this is from a live contest somewhere.