Longest Repeated Substring FIXED by nn

l;main(s,p)char*s,*p;{for(;gets(p);l=s[l]=0,puts(s))for(;memmem(p+1,99,p,l+1)?s=p,++l:*++p;);}

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

download

return to the top page