Search
Canvas, 17 11 bytes Ｚ２ｎ⤢Ｊ｛×７«ｍＴ Try it here! Z The alphabet 2n split into pairs: ["AB","CD","EF",…] ⤢ transposed: ["ACEGI…","BDFHJ…"] J remove and pu...
Yes! You can post it. As you are owner of that post. So, you can do as you want with the post. You can read about license in the question also. This post didn't use Codidact's import script; it...
Originally from Somewhere Else. I thought I'd continue making more drawing challenges here now that I discovered it. Make the Stack Overflow logo using the following criteria: The tray: ...
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 the...
Husk, 10 bytes kSo±-ȯΣhḊḣ Try it online! keyon is very nice here, but it's still a bit too long, sadly.
Here is what the top of the feed for the Code Golf Challenges category looks like currently: <?xml version="1.0" encoding="UTF-8"?> <feed xmlns="http://www.w3.org/2005/Atom"> <i...
Write the shortest program that takes no input and outputs a Sudoku solution. For reference, a Sudoku solution is a 9x9 grid of digits where each column, each row and each of the nine 3x3 grids th...
Idea shamelessly stolen from caird and rak1507 Shuffle a subset of a list of unique, positive integers with uniform randomness, given the indices of that subset. For example, given the list $[A, B...
JavaScript (V8), 44 bytes a=>a.map((a,x)=>a.map((n,y)=>n&&print(x,y))) Try it online!
APL (Dyalog Unicode), 21 bytes {×⍵-+/∪⍵∨¯1↓⍳⍵}¨∘⍳⊢⌸⍳ Try it online! Returns a matrix (padded with zeroes) where the first row is deficient numbers, the second is perfect numbers, and the thi...
Vyxal, 30 28 25 bytes Saved 1 4 bytes thanks to Aaron Miller ƛ∆K-±";£kɽƛ¥D„£_'t¥=;vṪ,£ Try it Online! A rather pitiful answer, but hey, it works. Gives deficient numbers, then perfect numbers...
Vyxal o, 16 bytes '∆K=;,'∆K<;,'∆K> Try it Online! Checks all numbers to see if they are perfect, then prints the ones that are, then does the same for abundant and deficient numbers. Ex...
Jelly, 1 byte Ḃ Try it online! Builtin. Returns 0 for even and 1 for odd
Japt, 1 byte u Japt, more like JABT (just another builtin) :P Try it
JavaScript (Node.js), 6 bytes n=>n%2 Try it online! Basically does what you'd expect.
Scala -language:postfixOps, 2 bytes 1& Try it online! 1 for odd, 0 for even. Scala, 3 bytes _%2 Try it online! 1 for odd, 0 for even.
Python 3, 98 bytes print(str(eval("("+input().replace(" ",")*(").replace("i","j")+")")).strip("()").replace("j","i")) Try it online! Since the input format is restrictive, I may as well just...
Python 3, 61 bytes lambda n,m:sum(randint(1,m)for i in[0]*n) from random import* Try it online! This is not an interesting answer as it is just a copy of your code. I tried to do it with ch...
Vyxal s, 5 bytes 2=A[5 Try it Online! You're not the only one who can abuse flags, Shaggy... 2= # Foreach, is it equal to to? A[ # If all are 2 5 # Push a 5. # (s flag) sum...
C (gcc), 35 32 bytes Saved 3 bytes thanks to Lundin f(n){n&&f(n/2);putchar(n&1|48);} This solution exploits that leading zeros, while not required, are also not forbidden by the ...
Since no one has posited anything yet... I think everything but the last three bullets can be kept. Other than that, we could add in the tips about challenge specifications. Challenges Posting...
jq, 14 bytes "Hello, \(.)!" Try it online! jq has expression interpolation, pretty epic!
Inspired by this Rosetta Code article. Introduction Balanced Ternary is a method of representing integers using -1, 0 and 1 in base 3. Decimal 11 = (1 * 32) + (1 * 31) + (−1 * 30) = [1,1,-1] or ...
