I often would like to ask mathematical coding questions in pairs. The first is a code-golf question. That is what is the shortest code that computes a given function? The other is at the other extreme and is a fastest-code question. That is what is the fastest code you can write to compute some f...
I often would like to ask mathematical coding questions in pairs. The first is a code-golf question. That is what is the shortest code that computes a given function? The other is at the other extreme and is a fastest-code question. That is what is the fastest code you can write to compute some f...
But take for example two identical challenges, where one is code-golf and one is fastest-code. Competitive code golf answers are likely to be brute force solutions, or written in things like GolfScript, which are notoriously slow....
you know...we've got an unwritten rule somewhere: We say that challenges are language-specific, and that you are really only competing against answers in that same language...
The challenge is to write the fastest code possible for computing the Hafnian of a matrix.
The Hafnian of an 2n-by-2n matrix A is defined as:
Here S2n represents the set of all permutations of the integers from 1 to 2n, that is [1, 2n].
The wikipedia link talks about adjacency matrices but ...
@Mr.Xcoder you changed: for j in range(1, n+1): prod *= matrix[sigma[2*j-2]-1][sigma[2*j-1]-1] to for j in range(n): prod *= matrix[sigma[2*j-1]][sigma[2*j]] but the j is multiplied by 2, so now it's still off by 1 with the opposite sign
csi is the best thing ever. I can use C# as a scripting langage without needing to define a class and Main method, there's a bunch of implicit imports for common functions, and it allows a #! line.
CMC: Given the Fenwick tree representing the array a of positive integers in its flat representation and and integer n, return the sum of the first n elements in a.
@EriktheOutgolfer the efficiency hit and its corresponding error of being dead tired is because of Err: Adaptation to Medication Required for a new med I'm on
also my instinct says that when you drink coffee you're doing more harm than good, since you are still tired, but just have temporary 5-hour energy or something
I mean drinking coffee in the morning to wake up is sometimes necessary in place of sleep because unfortunately not everyone is able to get up as late as they'd like because work :P
@Christopher So 'support both' means 'do it with ints', but then add a confusing after note about how there might be a flag added which doesn't actually affect what your program does
@DJMcMayhem no, support taking text and int input (not at the same time :P)
what about you have ur code. and you give a levithan distance, the robbers have to find the code with that levithan distance that takes text input instead of integer
Your task is to output the exact string
The Jabberwocky
without taking input.
Of course there is a catch, it wouldn't be fun without a catch. Your program, when stripped of non-alphabetic characters must start the poem The Jabberwocky.
Here is the text for reference:
twasbrilligandtheslith...
@Zacharý At any given position of the object, you can determine the image using the standard lens equations. From there, it's just a matter of integrating the path or interpolating the images at given times.
I meant to say given a moving point light source and a fixed mirror, how would one go about finding the areas that are not illuminated at any point in time?
I think I got it. Parametrize the path. Find formulas for the angle between a point on the path, an endpoint, and the mirror itself. Then find the minimum/maximum (depending on how it's measured) angle across the path using derivatives. Since either larger or smaller angles (depending on measurement) determine the amount of shadow, that should work. (I suck at explaining things)
@Zacharý Then you don't need a derivative to find min/max angle at all right
just use the angles from the two ends of the mirror
Anonymous
11:59 PM
Probably easier to start with a simpler version: consider a moving source that shoots out a single particle every t seconds, moving parallel to the plane of the mirror at velocity v. Compute the locations where the particles end up. Then take the limit as t -> +inf for a continuous stream of particles. Then you can consider stuff like luminosity and alternate paths of the source.
Your task is to output the exact string
The Jabberwocky
without taking input.
Of course there is a catch, it wouldn't be fun without a catch. Your program, when stripped of non-alphabetic characters must start the poem The Jabberwocky.
Here is the text for reference:
twasbrilligandtheslith...
