n=293801# Part 1
q=[3,7]e1,e2=0,1n_created=0whilen_created<n+10:r1,r2=q[e1],q[e2]forcinstr(r1+r2):q.append(int(c))n_created+=1e1=(e1+1+r1)%len(q)e2=(e2+1+r2)%len(q)print("".join(str(i)foriinq[n:n+10]))# Part 2
ns=str(n)defmatch(haystack):fornc,hinzip(reversed(ns),reversed(haystack)):ifnc!=str(h):returnFalsereturnTrueq=[3,7]e1,e2=0,1whileTrue:r1,r2=q[e1],q[e2]forcinstr(r1+r2):q.append(int(c))ifmatch(q):print(len(q)-len(str(n)))breakelse:e1=(e1+1+r1)%len(q)e2=(e2+1+r2)%len(q)continuebreak
For further actions, you may consider blocking this person and/or reporting abuse
We're a place where coders share, stay up-to-date and grow their careers.
Python