Communities

Writing
Writing
Codidact Meta
Codidact Meta
The Great Outdoors
The Great Outdoors
Photography & Video
Photography & Video
Scientific Speculation
Scientific Speculation
Cooking
Cooking
Electrical Engineering
Electrical Engineering
Judaism
Judaism
Languages & Linguistics
Languages & Linguistics
Software Development
Software Development
Mathematics
Mathematics
Christianity
Christianity
Code Golf
Code Golf
Music
Music
Physics
Physics
Linux Systems
Linux Systems
Power Users
Power Users
Tabletop RPGs
Tabletop RPGs
Community Proposals
Community Proposals
tag:snake search within a tag
answers:0 unanswered questions
user:xxxx search by author id
score:0.5 posts with 0.5+ score
"snake oil" exact phrase
votes:4 posts with 4+ votes
created:<1w created < 1 week ago
post_type:xxxx type of post
Search help
Notifications
Mark all as read See all your notifications »

Activity for caird coinheringaahing‭

Type On... Excerpt Status Date
Comment Post #283789 I'd imagine that a lot of answers will just be trivial builtins. A single answer of all of these might be a better idea
(more)
about 3 years ago
Edit Post #283731 Initial revision about 3 years ago
Answer A: Roll n fair dice
[Jelly], 4 bytes X}€S Try it online! How it works X}€S - Main link. Takes n on the left, m on the right € - Over each element of 1 through n: } - With m as its argument: X - Yield a random integer from 1 to m S - Sum
(more)
about 3 years ago
Edit Post #283691 Post edited:
about 3 years ago
Edit Post #283691 Initial revision about 3 years ago
Answer A: Multiply two strings
[Jelly], 2 bytes «þ Try it online! Technically speaking, this needs to be a full program, due to how Jelly's smash printing works, but it can get away with being run as a function over test cases. Essentially, this generates a matrix \$M\$ where \$M{ij}\$ is given by \$\min(ai, bj...
(more)
about 3 years ago
Edit Post #283315 Initial revision about 3 years ago
Answer A: Are All Elements Equal?
[Jelly], 1 byte E Try it online! Boring builtin answer Non builtin, the shortest I can get is 3 bytes: ḷ\⁼ Try it online! Here, we replace each element with the first element, then check if that is equal to the original array
(more)
about 3 years ago
Edit Post #283269 Initial revision about 3 years ago
Answer A: Reduce over the range [1..n]
[Jelly], 3 bytes Rç/ Try it online! Takes `f` as the helper link. Very basic, `R` casts to range, then `ç/` reduces by the helper link
(more)
about 3 years ago
Edit Post #282588 Post edited:
over 3 years ago
Edit Post #282588 Post edited:
over 3 years ago
Edit Post #282588 Initial revision over 3 years ago
Answer A: Add two negabinary integers
[Jelly], 6 bytes ḅSbɗ-2 Try it online! Takes input and output as a pair of lists of digits. The Footer converts to and from. Jelly's generalised base conversion works for all integer bases, and allows converting from complex bases. How it works ḅSbɗ-2 - Main link. Takes ...
(more)
over 3 years ago
Edit Post #282498 Post edited:
over 3 years ago
Edit Post #282498 Initial revision over 3 years ago
Answer A: Shuffle a subset of a list
[Jelly], 7 bytes œPżịẊ¥F Try it online! Takes the 1-indexed indices on the left and the list on the right How it works œPżịẊ¥F - Main link. Takes I on the left and L on the right œP - Partition L after the indices in I, removing the borders ¥ - Group th...
(more)
over 3 years ago
Edit Post #282455 Post edited:
over 3 years ago
Suggested Edit Post #282455 Suggested edit:

(more)
helpful over 3 years ago
Comment Post #282455 Can we use our language's native complex number syntax (e.g. `j` instead of `i` for Python, or `ı` instead of `i` for Jelly etc.)?
(more)
over 3 years ago
Edit Post #282422 Initial revision over 3 years ago
Answer A: Evens or Odds - you know this one
[Jelly], 1 byte Ḃ Try it online! Builtin. Returns `0` for even and `1` for odd
(more)
over 3 years ago
Edit Post #282360 Initial revision over 3 years ago
Answer A: Partial Sums of Harmonic Series
[Jelly], 8 bytes İ€S<¬ʋ1# Try it online! How it works İ€S<¬ʋ1# - Main link. Takes n on the left ʋ - Group the previous 4 links into a dyad f(k, n): € - Over each integer 1 to k: İ - Get its reciprocal S - Sum < ...
(more)
over 3 years ago
Comment Post #282290 [185 bytes](https://tio.run/##XY3LDoIwEEXX7VfUhQmljaQaNoXxRwiL8tJpyEAqLvz6So1u3NzcM3OSu762@0KXGDtoTFv10LSV24NPSxAkkERwdBuzs0baMqT1uWVSKiMtZwMYzpKH/x7l@an8WgwnQUesTepsUICVByoKTLj//AHQ7mfPEw1Xsk4Bac7GOXFNtvvxY7T9p68hrTjd607GaMo3)
(more)
over 3 years ago
Comment Post #282244 @DerrickWilliams Any format that clearly distinguishes the output is fine - the format I've used is not required
(more)
over 3 years ago
Comment Post #282244 @MonicaCellio The examples are just that - examples. You're free to output the three lists in any order (and the elements in those lists in any order), so long as there is a clear distinction between the lists themselves and between the elements in the lists
(more)
over 3 years ago
Edit Post #280372 Post edited:
Added array manipulation tag
over 3 years ago
Suggested Edit Post #280372 Suggested edit:
Added array manipulation tag
(more)
helpful over 3 years ago
Comment Post #282244 Brownie points for beating or matching my 6 byte Jelly answer
(more)
over 3 years ago
Edit Post #282244 Initial revision over 3 years ago
Question Are they abundant, deficient or perfect?
Abundant numbers are numbers which are less than their proper divisor sum. For example \$18\$ is abundant as \$1 + 2 + 3 + 6 + 9 = 21 > 18\$ Deficient numbers are numbers which are greater than their proper divisor sum. For example, \$15\$ is deficient as \$1 + 3 + 5 = 9 [[12, 18, 20, 24, 30, 36,...
(more)
over 3 years ago
Edit Post #282181 Initial revision over 3 years ago
Question Should challenges be worth 10 reputation?
The fourth highest voted CGCC Meta question asks that SE increases reputation for questions. This is now status completed across the entirety of the Stack Exchange network. However, I notice that it isn't active here. According to Monica Cellio, it's completely doable to change the reputation levels,...
(more)
over 3 years ago
Edit Post #282082 Post edited:
over 3 years ago
Edit Post #282082 Initial revision over 3 years ago
Answer A: Evaluation order of an APL n-train
[Jelly], 5 bytes ḶHĊUỤ Try it online! Uses xash's method over on CGCC How it works ḶHĊUỤ - Main link. Takes n on the left Ḷ - Range from 0 to n-1 H - Halve Ċ - Ceiling U - Reverse Ụ - Grade; Sort the indices of n by its ele...
(more)
over 3 years ago
Edit Post #282063 Post edited:
over 3 years ago
Edit Post #282063 Initial revision over 3 years ago
Answer A: Create an Alphabet Diamond
[Jelly], 13 bytes ØAUƤz⁶ZUŒBŒḄY Try it online! How it works ØAUƤz⁶ZUŒBŒḄY - Main link. Takes no arguments ØA - Yield the uppercase alphabet Ƥ - Over each prefix: U - Reverse it z⁶ - Zip, padding with spaces ...
(more)
over 3 years ago
Edit Post #281962 Initial revision over 3 years ago
Answer A: Backspace an array
[Jelly], 6 bytes ṣ0Ṗ;¥/ Try it online! How it works ṣ0Ṗ;¥/ - Main link. Takes a list on the left ṣ0 - Split at zeroes ¥/ - Reduce by: Ṗ - Remove the last element ; - Concatenate
(more)
over 3 years ago
Comment Post #281806 [61 bytes](https://tio.run/##FcxBCoMwEAXQfU4xm8KMWmmVbiw5SemiYFIHyleGSDELrx7xAO8tW5pm9KWMIVJkyOAo@xfejv6T/sJ@xQCvSIyqYly6un2IPHPt0TiykFYD5RJnIyUF2QffwPeGuttZLXbSyCpSD)
(more)
over 3 years ago
Comment Post #281599 Brownie points for beating or matching my 7 byte Jelly answer
(more)
over 3 years ago
Edit Post #281599 Initial revision over 3 years ago
Question Juggler sequences
A Juggler sequence is a sequence that begins with a positive integer \$a0\$ and each subsequent term is calculated as: $$a{k+1} = \begin{cases} \left \lfloor ak ^ \frac 1 2 \right \rfloor, & \text{if } ak \text{ is even}\\\\\ \left \lfloor ak ^ \frac 3 2 \right \rfloor, & \text{if } ak \text{ is...
(more)
over 3 years ago
Comment Post #281501 @Razetime Indeed it does, thanks!
(more)
over 3 years ago
Edit Post #281501 Post edited:
over 3 years ago
Edit Post #281501 Post edited:
over 3 years ago
Edit Post #281501 Initial revision over 3 years ago