Longest Repeated Substring FIXED by eiyuu

main(j,s){char*c;for(;gets(s);c[j]=0,puts(c))for(j=99;!memmem(c+1,99,c,j-=!*++c&&(c=s)););}

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

download

return to the top page