shortest non occuring sequence

Submit

Language is selected by the extension of the file. See the list of supported languages to know the extension of your language.

Problem

Find the shortest non occuring sequence of characters a..e which have at least length 1. use lexicographic order.

Example

abcd <- does not contain e.
aabbbcccdddeee <- does not contain ac
acdbdcaabbb <- contains a,b,c and d.
Contains aa,ab,ac but does not contain ad => ad is the shortest non occuring sequence.

Options

exec is denied

now post-mortem time, all source codes will be revealed

Sample input:_

abcd
aabbbcccdddeee
eacdbdcaabbb

Sample output:

e
ac
ad

Sample input:_

aabacadae
bbccacbebceaaeeabaddd
a
dadbec
deadbeeaaab

Sample output:

bb
bd
b
aa
c

Sample input:_

abbcbbdbecbcebacbadaeacbacdaeacb
aaacbcbacbaeacaeaceaddadaeaeadac
acbacababcadadaeaeacacacaaeababc
aabeeeddecdccbebdbbabaaacbcbacbaeacaeaceaddadaeaeadac
aabeaaeeeddecdccbebdbbabaaacbcbacbaeacaeaceaddadaeaaadeadac
abbcaaacbbdbecbcebacbadaeacbacdaeacb
dcabbcaaacbbdbecbcebacbadaeacbacdaeaccb
abaaaeaadeedcaabbcaaacbbdbecbcebacbadaeacbacdaeaccbdd
eedcdccecdddaccbdebeddbbacababcadadaeaeacacacaaeababc
baeaeeaedaecaebaddadcadbacdacbabeabdabbaadeeaacedcdccecdddaccbdebeddbbacababcadadaeaeacacacaaeaaababc
becbddbdcbcebcdbccbbebbdbbcbbbaeaeeaedaecaebaddadcadbacdacbabeabdabbaadeeaacedcdccecdddaccbdebeddbbacababcadadaeaeacacacaaeaaababc
eeedeebebddecdeaddcdcedaaceeceaccdccabecbddbdcbcebcdbccbbebbdbbcbbbaeaeeaedaecaebaddadcadbacdacbabeabdabbaadeeaacedcdccecdddaccbdebeddbbacababcadadaeaeacacacaaeaaababcbeeccccdedbeddede

Sample output:

aa
ab
bb
aad
abb
cc
dd
abc
aaa
bbb
bee
aaaa

Ranking

Ruby _

Perl _

Python _

Scheme _

Io _

J _

K _

Haskell _

sed _

Brainfuck _

GolfScript _

gs2 _

Burlesque _

Language Ranking_

return to the top page