@RikerW I created a character for a story I was writing, maybe a decade ago now, that was an author insert. That is, myself. But I didn't want to use my real name, so I took the first three letters, shuffled them around, and added some more letters. Thus, "Elendia". People were saying it with a silent E at the beginning, though, so I added the apostrophe - "El'endia". The full name is "El'endia Pi Starman" because I like pi and stars. :P
Python 453 440 406 380 bytes
EDIT: Thanks to Cyoce for reducing 13 bytes!
EDIT: Thanks again to Cyoce!
EDIT: Thanks to RainerP. for helping me imrpove the algorithm on certain invalid cases.
This is a rough draft of a Python program. I believe it can be definitely golfed, maybe to 300-400 byt...
@AlexA. actually in reality I'm not talking about exams, I asked a riddle from someone and he didn't give me a good answer and constantly asked something about my riddle. Now I want to say him, "you {destroy} my riddle"
@flawr Looks like you shared the Music and Measure Theory video before because I've seen that one, but I haven't seen the others. I'll check them out. Thanks!
I don't know what percentage of the doodling was in math class, but I do know what percentage of math class was doodling. Most of it, even the vector calc class I just finished.
In 7th grade, an friend and I spent a lot of time drawing impossible squares, similar to this or this. Except that we drew every possible impossible square.
@PhiNotPi i understand what you mean by this but my brain saw len([s for s in squares if s.possible and (not s.possible)]) and optimized it to ...if False before i figured it out
Turing Machine Simulator - 15660 bytes (Non-Competing)
Can't have an Enigma challenge without turing machine code.
0 * * l 0
0 _ _ l ,
, _ , l 1
1 _ 0 r 2
2 * * r 2
2 , * r 3
3 * * r 3
3 , * r 4
4 * * r 4
4 _ * r 13
4 A a l a' ...
This challenge is based off of Flow Free. An online version can be found here: http://www.moh97.us/
You will be given a puzzle, and you must return 1 if the puzzle is solvable, or 0 if it is not.
To solve a puzzle, the player must create a path to connect each pair of numbers using every empty...
I would ask if you have any fun birthday plans, but based on the fact that you went half the day without realizing it was your birthday, I'm going to guess no.
Python 453 440 406 380 bytes
EDIT: Thanks to Cyoce for reducing 13 bytes!
EDIT: Thanks again to Cyoce!
EDIT: Thanks to RainerP. for helping me imrpove the algorithm on certain invalid cases.
This is a rough draft of a Python program. I believe it can be definitely golfed, maybe to 300-400 byt...
Turing Machine Simulator - 15660 bytes (Non-Competing)
Can't have an Enigma challenge without turing machine code.
0 * * l 0
0 _ _ l ,
, _ , l 1
1 _ 0 r 2
2 * * r 2
2 , * r 3
3 * * r 3
3 , * r 4
4 * * r 4
4 _ * r 13
4 A a l a' ...
This challenge is based off of Flow Free. An online version can be found here: http://www.moh97.us/
You will be given a puzzle, and you must return 1 if the puzzle is solvable, or 0 if it is not.
To solve a puzzle, the player must create a path to connect each pair of numbers using every empty...
