compression challenge but not in the way you think by btnlq

while 1:
 s=input().split();i=0
 while s[i:]:c,n=s[i];n=int(n);s[i:i+1]=s[i-n:i]*(c>'L');i+=n
 print(*s)

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

To protect the system from spam, please input your favorite sport (hint: I believe its name must start with 'g', case insensitive)

download

return to the top page