Tick Action: "n" to left brace, "n" equals 1 : "n" , left brace, mod left parenthesis, "n" , 2 , right parenthesis equals 1 : "F" left parenthesis, "n" , right parenthesis , "G" left parenthesis, "n" , right parenthesis , right brace , right brace , "c" to left brace, "n" equals 1 : "c" , "c" plus 1 , right brace , "y" Subscript, 1 , Baseline to left brace, total left parenthesis, "c" , right parenthesis equals 0 : "y" Subscript, 1 , Baseline , left brace, count left parenthesis, "y" Subscript, 1 , Baseline , right parenthesis equals count left parenthesis, "x" Subscript, 1 , Baseline , right parenthesis : "y" Subscript, 1 , Baseline , join left parenthesis, "y" Subscript, 1 , Baseline , "n" , right parenthesis , right brace , right bracen→n=1:n,modn,2=1:Fn,Gn,c→n=1:c,c+1,y1→totalc=0:y1,county1=countx1:y1,joiny1,n
every
Min Step Time: 200200
ms
Expression 5: "c" to 0 , "y" Subscript, 1 , Baseline to "s" , "n" to "s"c→0,y1→s,n→s
5
Expression 6: "s" to floor left parenthesis, 100random left parenthesis, 1 , right parenthesis , right parenthesiss→floor100random1
6
n represents the current number, which will be constantly updated by the ticker, c is the number of iterations, and s is the starting number
