Given binary array X, decide if for each 0≤i<len(X), X[i] = X[(i + 2len(X)) mod len(X)].
Sandbox Notes
This comes from puzzle where the array is the lamps. Should I use another equivalent expression than above?
I have never been so happy to listen to steamed hams in my whole life
(I just finished a successful test run of a youtube to mp3 converter website I made :p)
it's really cursed because it uses github workflows to do the processing, has another repo to handle file storage, a pythonanywhere hosted flask app which acts as a middleman to serve private github files to the react js
I won't be making any source code public because it contains github PATs and youtube cookies :p
+ the fact I made it for fun when there's like a whole plethora of other yt2mp3 sites
@lyxal aren't there, like, established solutions for dealing with this
I don't know what they are, granted
but it could be as simple as putting them in a file in the repo that you just have in your .gitignore and leaving a note somewhere like "hey yeah this file needs to have API keys in it"
@Themoonisacheese ...I just now actually read the "avoid missing ball for high score" article it linked, and I spent like an entire minute trying to figure out what the point of alluding to 9/11 was until I noticed the article was written in 2001 and probably was by sheer coincidence actually just written and published on 9/11
I have the following Python code, which is 214 bytes long:
G=print
B=input
A=int
H,M,N,O,I,P,Q,J=map(A,B().split())
C=[I]*H
for R in range(J):K,L=map(A,B().split());C[K]=L
while 1:D,E,F=B().split();G(['WAIT','BLOCK'][A(E)<C[A(D)]and F=='LEFT'or A(E)>C[A(D)]and F=='RIGHT'])
Is there a way to redu...
In this crossword puzzle by Jack Lance, all the letters (well, most of them) have been replaved by a fixed text string: All work and no play makes Jack a dull boy. Therefore, you have to rely on clues like digits, capitalisation, special characters and the number of letters in each word to comple...
Given binary array X, decide if for each 0≤i<len(X), X[i] = X[(i + 2len(X)) mod len(X)].
Sandbox Notes
This comes from puzzle where the array is the lamps. Should I use another equivalent expression than above?
