Here's my entry:
char grade( int score )
{
int nIdx = floor(((score - -2.0) *
0.045283969041293934) -
(cos(cos(score * 0.03114100715856666) *
1.5790931375763757) * 1.98522506643194));
return 'FDCBA'[nIdx];
}

godbolt.org/z/77sfs1f8q

the other answers are all wrong because they don't use enough category theory; the grades reveal an elegant semigroup structure with F as the identity element thus making them monoidal. also, grade ranges are clearly monadic

That means that:
def f(l = []):
print(l)
l.append('another')
f()
f()
prints out ['another'] in the second call to f().

Given a seq. of ints from a PRNG, is there a good test of how much knowing n_i helps in predicting n_{i+1}? I guess like auto-corr. but more model-free? Maybe cond. entropy? It's okay if it's compute intensive. Can you tell I have stuff due tomorrow?
Sam Power Daniel Litt

This is what happens when you remove explicit pointers/reference types from your language. :-)

Pseudo-random number generation is hard. From a titan in computer science, Donald Knuth, a 'super-random' generator:😂

The neat thing about the prevalence of the pentatonic scale is that it's often possible to combine tunes across musical cultures pretty seamlessly!

Growing up I often thought Dvorak's 'New World Symphony' was a Chinese melody, just because it's pentatonic.

Congrats to Josiah Moltz at Binghamton University for Honorable Mention!

When you are first shown a function that is continuous at every irrational number but discontinuous at at rational number