find minimum cyclic parts by 51b

import std.stdio;void main(){int n;for(string s;s=readln,s;writeln(s[0..n]))for(n=1;s!=s[n..$-1]~s[0..n]~\n;)n++;}

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

download

return to the top page