00:00 - 19:0019:00 - 00:00
Anonymous
Anonymous
Anonymous
Anonymous
Anonymous
Anonymous
Anonymous
C (gcc)
Around 0.6 sec for 1,000,000.
int modpow(long b,int e,long n){
long r=1;
while(e){
if(e&1) r=r*b%n;
b=b*b%n;
e>>=1;
}
return r;
}
float f(int a,int b){
int ln=1;
for(int p=2;p<=a;p*=ln,ln++);
int* primes = malloc((a+1)*(sizeof(int)));
int** factors = malloc((a+1)*sizeof(...
Sort a nested object by nested value
code-golf
Your goal is to sort a nested object by a nested value. What does that mean? For example:
#1: Input
{
foo: {
category: "A",
hello: "world",
color: "blue"
},
bar: {
category: "B",
cu: "cumber",
...Anonymous
Anonymous
Anonymous
Frequency Distribution of Multiple Dice Rolls
Given two positive integers a and b, output either the frequency distribution of rolling a b-sided die a times and adding the results.
A frequency distribution lists the frequency of each possible sum if each possible sequence of dice rolls occurs o...Anonymous
Anonymous
Anonymous
Anonymous
Anonymous
Anonymous
Anonymous
Anonymous
0
The APL code page is an EBCDIC-based code page used specifically to write programs written in the APL programming language.
== Character set ==
Due to its origins on IBM Selectric-based teleprinters, APL symbols have traditionally been represented on the wire using a unique, non-standard character set. In the beginning, there were few terminal devices which could reproduce them—the most popular ones being the IBM 2741 and IBM 1050 fitted with a specific APL print head. Over time, with the universal use of high-quality graphic display, printing devices and Unicode support, the APL character font...
1
Background
Skip to "Task" if you are familiar with Tic-Tac-Toe (I think most are!)
Tic-Tac-Toe is a famous two-player game. It consists of a 3x3 board that is filled gradually by two players (clarifications below); The first player uses the character X and the other one uses O. The winner is th...
Challenge
You are given two bit strings of the same length. (For example, 000 and 111.) Your goal is to find a path from one to the other such that:
at each step, you change only one bit (you can go from 000 to any of 001, 010, 100).
you cannot visit the same bit string twice.
the path is as l...
As you may know a few days ago I asked you guys to prove (-a) × (-a) = a × a in as few steps as possible and it seems to have been more of a success than I had ever imagined. We've had a lot of fun and generated some really small proofs!
What you may not know is that I asked another proof-golf ...
00:00 - 19:0019:00 - 00:00
