> Begin deployment for all users on sites with custom themes. Plan is to do this roughly by site age, though we reserve the right to vary the order due to implementation concerns.
> though we reserve the right to vary the order due to implementation concerns.
> Day-0 DLC has arrived to technical literature. John really is ahead of the curve. Errata can only be accessed via microtransactions. And loot boxes have a chance to drop full code samples... the F2P version leaves everything as an exercise for the reader.
Gaia
Interpreter | Documentation | Online interpreter
Gaia is a stack-based golfing languages created by PPCG used Business Cat about a year ago, in late May 2017.
There are a couple of things that make Gaia a very good competitor for the Language of the Month event:
Terseness and Ease of ...
It appears that when you press three or more keys at once, it stops detecting any more keys down until you lift one. (Tested with Firefox 22) — QvcoolJul 28 '13 at 22:10
CMC:This simple SO question, with any consistent value instead of 0 being acceptable. You should take the second list as input either as a list of lists, a list of tuples, or a list of integers, whose pairs of two consecutive elements represent the tuples, or as a dict. [2, 4, 6, 7, 8] , [(4,6), (6,8), (8,10)] -> [0, 6, 8, 0, 10]
@HyperNeutrino if i press and hold Q and W at the same time then press and hold E afterwards it types: "qwqwqwqwqwqwqweeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeee..."
Challenge :
Given a sequence of length A, in some random order, rearrange it so it fits the rules.
Rules :
Take some integer a , and then performs on it A − 1 operations.
The operations are :
divide the number a by 3 (iff a multiple of 3)
multiply the number a by 2 (iff a not a multiple...
and it beats the other version too :D a=>map(dict(a).get)
@MuhammadSalman For your /3 *2 challenge, you could just define 3 to be either a multiple or not a multiple of 3. I would say it should be considered to be that. Also, I don't see why 6 -> 12 because 6 is a multiple of 3 as well. I'd say that 9 -> 3 -> 1 -> 2 -> 4 -> 8 which is what my current program gives.
@MuhammadSalman remember, there's the sandbox, I recommend you to use that first until you become confident that you can write challenges with very minor to no flaws (2 years practically in here, I'm still not that confident :P)
Here's a programming puzzle for you:
Given a list of pairs of string and corresponding number e.g.
Input sample one
[[A,37],[B,27],[C,21],[D,11],[E,10],[F,9],[G,3],[H,2]]
Output another list which will have just the strings in the following manner
Total count of any string should be exactly...
I agree. Along with the other one-byte aliases for 2-byters because 05AB1E can really wreck Jelly on some challenges where both have the right builtins and both are used monadically (Jelly monadic chains are basically stack-based)
@Zacharý It was a gradual development. APL … Ops & Fns … Rationalized … Dictionary (which includes an ASCII transliteration scheme using @ and @@ as "inflections") … APL\? (which uses . and :) … Tacit Definition … J.
Given:
a function f(a, b, c, d, e) = a * b / c + d / e
an array x = [x1, x2, x3, x4, ..., xn] of non-distinct values
a target value k
What is the most efficient way to find 5 distintict indices xa, xb, xc, xd, xe from x such that f(x[xa], x[xb], x[xc], x[xd], x[xe]) = k?
Gaia
Interpreter | Documentation | Online interpreter
Gaia is a stack-based golfing languages created by PPCG used Business Cat about a year ago, in late May 2017.
There are a couple of things that make Gaia a very good competitor for the Language of the Month event:
Terseness and Ease of ...
Challenge :
Given a sequence of length A, in some random order, rearrange it so it fits the rules.
Rules :
Take some integer a , and then performs on it A − 1 operations.
The operations are :
divide the number a by 3 (iff a multiple of 3)
multiply the number a by 2 (iff a not a multiple...
Here's a programming puzzle for you:
Given a list of pairs of string and corresponding number e.g.
Input sample one
[[A,37],[B,27],[C,21],[D,11],[E,10],[F,9],[G,3],[H,2]]
Output another list which will have just the strings in the following manner
Total count of any string should be exactly...
Given:
a function f(a, b, c, d, e) = a * b / c + d / e
an array x = [x1, x2, x3, x4, ..., xn] of non-distinct values
a target value k
What is the most efficient way to find 5 distintict indices xa, xb, xc, xd, xe from x such that f(x[xa], x[xb], x[xc], x[xd], x[xe]) = k?
