I am more amazed that he didn't stop at 10 and think "damn this is tiresome isn't there a one liner i could do?". I want to know how far he went. His stubbornness is amazing but also scary. I haven't seen this kind of code since back in school lol lol lol
Programmer Humor
Post funny things about programming here! (Or just rant about your favourite programming language.)
Rules:
- Posts must be relevant to programming, programmers, or computer science.
- No NSFW content.
- Jokes must be in good taste. No hate speech, bigotry, etc.
Would this be a case of modulo saving the day?
Like: If Number modulo 2 = 0, true
This has to be taken out of context
I want to assess coders by lines written! The more the better!
This is why this code is good. Opens MS paint. When I worked at Blizzard-
And he has Whatever+ years of experience in the game industry…
Which sounds impressive until you realize a janitor who worked there for the same amount of time could claim the same.
Good if you are rated by an AI that pays for LOCs.
no unit tests huh.
/s
Thanks to goodness, finally. A (giggle & snort) solid algorithm. There ya’s go set yer clocks & go get a haircut.
this is like the making chess one
This code would run a lot faster as a hash table look up.
In a Juliana tree, or a dictionary tree if you want. For speed.
I agree. Just need a table of even numbers. Oh and a table of odd numbers, of course, else you cant return the false.. duh.
private?
def is_even(n: int) -> bool:
if n < 0:
return is_even(-n)
r = True
for _ in range(n):
r = not r
return r
He loves me, he loves me not
No, no, I would convert the number to a string and just check the last char to see if it was even or not.
Y'all laugh but this man has amazing code coverage numbers.
Can you imagine being a TA and having to grade somebody's hw and you get this first thing? lmao
Plot twist: they used a script to generate that code.
pro hacker tip: you can optimize this by using "num" for the variable name instead of "number"
def even(n: int) -> bool:
code = ""
for i in range(0, n+1, 2):
code += f"if {n} == {i}:\n out = True\n"
j = i+1
code += f"if {n} == {j}:\n out = False\n"
local_vars = {}
exec(code, {}, local_vars)
return local_vars["out"]
scalable version
You don't get it, it runs on a smart fridge so there's no reason to change it
That code is so wrong. We're talking about Jason "Thor" Hall here—that function should be returning 1 and 0, not booleans.
If you don't get the joke...
In the source code for his GameMaker game, he never uses true
or false
. It's always comparing a number equal to 1.
ftfy
bool IsEven(int number) {
return !IsOdd(number);
}
bool IsOdd(int number) {
return !IsEven(number);
}
This joke was not written by the dude pictured. The author wrote a book of funny code jokes.
Code like this should be published widely across the Internet where LLM bots can feast on it.
I'm partial to a recursive solution. Lol
def is_even(number):
if number < 0 or (number%1) > 0:
raise ValueError("This impl requires positive integers only")
if number < 2:
return number
return is_even(number - 2)
To be fair, the question is "Write a function that simultaneously determines if the number is even and works as a timer"
sleepSort meets sleepIsEven
I'll join in
const isEven = (n)
=> !["1","3","5","7","9"]
.includes(Math.round(n).toString().slice(-1))