Desmos, 31 bytes
h(x)=f(x)-g(x)
h(0)/(h(0)-h(1))
Try it here.
Takes 2 functions f(x) and g(x) for each side of the equation. No builtins!
Given a matrix A, we can say that it is "sorted" if each row and column of A is sorted (ascending left-to-right for rows and top-to-bottom for columns). Thus, this matrix is sorted:
[ 1 2 3 4 5 ]
[ 2 2 3 4 5 ]
[ 3 3 3 4 5 ]
[ 4 4 4 4 5 ]
[ 5 5 5 5 5 ]
However, this matrix is not sorted:
[ 1 2...
Introduction
As we probably all know, making a maze by hand is a long and arduous task. So let's generate a new one.
Your task here is to generate a maze so that the shortest path through the maze resembles the mandlebrot set.
As an example, here is a maze and it's shortest path, starting fro...
55
tl;dr:
We’re planning to make some changes to our ToS to stop companies from scraping user profile information from multiple websites and then spamming them. The changes only restrict a specific kind of commercial use of profile data that is scraped or copied from our site without the user’s per...
You have to take a base-10 number (e.g. 735) and another number for the base to convert to, and convert the base-10 number into the equivalent number in the other base.
Rules:
You aren't allowed to use any conversion functions built into your language
This is code-golf, the shortest answer i...
Calculate the last N digits of Graham's Number
fastest-code
Write a function or program that, given an integer x, outputs the rightmost x digits of Graham's Number.
Rules:
You may not hardcode the answer in
You may not fetch the answer from an external file or library
Scoring:
To Be ...
Perl 5.10, 139 bytes, cracked by primo
~!0!~('@"/(@`)~@``^"|'.(('"
_]'^'|"`&').('[)).["[}(@,@@
{~/),$}@{**(!(^$&%{%{*[/,`,
'^'+[@@/+{_`%@,/&[)@[@@_`[#
!(!~-/,[,[#{&%@').'"!"})'))
Verification
For obvious reasons, the above code is deemed unsafe in modern versions of Perl.
However, in Perl 5....
0
Using a non-free language on a Cops and Robbers challenge
Most (currently all) cops and robbers challenges consist of two parts:
A cop submission, where a user posts some secret property of a program, such as its output, a scrambled version of the code, etc.
Then, other users, the robbers, try...
Mathcad, 67 "bytes"
creates a column vector of consecutive integers in range 1..R, joins it to a column vector of length R of (uniform) random numbers, sorts the resulting Rx2 matrix on the random number column, and then extracts the first n numbers from the randomized column of integers.
Smalltalk, 1098 primes
First off, nice hard question - as evidenced by the lack of non-trivial responses thus far.
I had a solution cooking at work, but had to wait for the long weekend to have time to clean it up a bit. Even so, it's quite "heavy", so excuse the length of this answer - thankfu...
Javascript, score 659
Almost certainly suboptimal.
lenof=function(a){return (""+a).length}
Array.prototype.peek=function(){return this[this.length-1]}
primes=[
11, 13, 17, 19, 23, 29, 31,
37, 41, 43, 47, 53, 59, 61,
67, 71, 73, 79, 83, 89, 97,
101, 103, 107, 109, 113, 127,
131, 137, 139, 149, 1...
I feel like we may have enough data on this site to meaningfully break programming languages into classes.
What I mean by classes is akin to Go's ranking system:
If a player can win 90% of even games against a 2 kyu player, the AGA believes he or she is 1.33 ranks higher, the EGF believes (s...
Input
A single character, [a-g], from STDIN.
Output
Produce, in any format you choose, a 1.5 second tone corresponding to the musical note of the character. The note may be from any octave but must be within the range of normal human hearing (20 Hz to 20000 Hz). See piano key frequencies. You ...
