Mutated worm
Public  04/17/17  10xp  Programming  53.8% 
See the problem 371 by Philippe. We slightly modify the evolution code in that it creates m copies instead of (m+1) at m_{th} step. So the evolution of [1,1] now becomes like the following: 1: [1, 1] 2: [1, 0, 1, 0] 3: [1, 0, 1] 4: [1, 0, 0, 0, 0, 0] 5: [1, 0, 0, 0, 0] 6: [1, 0, 0, 0] 7: [1, 0, 0] 8: [1, 0] 9: [1] 10: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0] 11: [0, 0, 0, 0, 0, 0, 0, 0, 0] 12: [0, 0, 0, 0, 0, 0, 0, 0] 13: [0, 0, 0, 0, 0, 0, 0] 14: [0, 0, 0, 0, 0, 0] 15: [0, 0, 0, 0, 0] 16: [0, 0, 0, 0] 17: [0, 0, 0] 18: [0, 0] 19: [0] 20: [] At which step does the worm W_{1} = [1,2] turn into []? Answer format: rightmost 20 digits [My timing < 1s]
Fresh Problems

Polygons ratio 2d:6h
solved by 8 
Best Matrices Multiplication 1w:2d
solved by 9 
Equations 1w:5d
solved by 10 
First semiprime 2w:2d
solved by 10 
Triangles ratio 3w
solved by 12