non increasing subsequence by twobit

import re
while 1:print max(re.findall("9*8*7*6*5*4*3*2*1*0*",`input()`),key=len)

Note that non-ascii characters in the above source code will be escaped (such as \x9f).

download

return to the top page