find minimum cyclic parts by 51b(embed)

char s[];main(n,q){for(;gets(s);)puts(s+" \x13\x13\x09>\x06\x04\x02"[n++-q%3*4]);}

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

download

return to the top page