@taRadvylfsriksushilani I was trying to make the screen solid white and joke that that's what happens when you point a camera at the Actual Sun but it broke so :/
Golf a prime generating polynomial
Do you know what is the oldest known turing-complete programming language? I would argue it's the Diophantine equation. It can represent any recursively enumerable set of integers. Your challenge is to golf a prime generating Diophantine equation.
A Diophantine ...
I think the school wifi's trying to throttle the speed of the connection, maybe it thinks I'm streaming video and it's trying to force it to switch to a lower bitrate?
E.g., I can SSH, use chat, open a CGCC page or two, that sort of thing, but any attempt to go to something like YT or reddit immediately starts dropping a ton of packets
Maybe I could artifically lower the bandwidth...
Like have a queue, and send a maximum of one packet every x milliseconds
Return [[0, 0, 0], [0, 1, 0], [0, 0, 0]]
Task
Your Task is very simple, Return/Print
[[0, 0, 0], [0, 1, 0], [0, 0, 0]]
You can print (APL lists or related lists)
0 0 0
0 1 0
0 0 0
But not this (Charcoal)
-
Printing this
0
0
0
0
1
0
0
0
0
Is fine
@Fmbalbuena There's basically no room for creativity. Every answer will either print the list directly, or use a property of 5 and reshaping the range [1,9]
@Fmbalbuena Because you've asked if it's "correct" - that's off-topic here. We don't check if code is correct, we make it shorter
Print The Knight Piece
Task
Your Task is to print the knight piece
The knight piece is:
|\_
/ .\_
| ___)
| \
| = |
/_____\
[_______]
Rules
The output must be exact, trailing newline are allowed
The Input Must be Empty
Meta
Any?
I've been trying to get 10 more rep to hit the rep cap for today and it turns out that I already hit 200 the drop down is just incorrectly displaying 190.
@WheatWizard Unfortunately, that's not the case. If you hit the cap, any and all positive rep is then discarded, but negative rep can drop you under it
I agree tho that it should be "We take the net rep change in a day, and if it's over 200, we cap it" rather than "Once you hit 200, no more increase, but can still decrease"
If you get 50 upvotes in a day and one downvote, you can get less rep than if you get 21 upvotes and 5 downvotes, depending on the timing
They are the same vote IDs as VoteTypeID in the Votes SEDE table: 1 is accepted, 2 is upvote, 3 is downvote, 8 is set bounty, 9 is get bounty, 16 is suggested edit approved
I'll give imaginary brownie points to anyone who tries it in Pip--there are several ways to do it, and the shortest that I've found so far is not obvious.
3‿3⥊4=↕9 seems like the obvious way to do it in BQN... I wonder if there's anything shorter.
@DLosc Found two other solutions that tie my previous shortest
@DLosc Yeah, the quick þ takes a dyadic link f, and two lists (one on the left, one on the right), and runs x f y for each elements x, y in the arguments
I laugh because I just ran into the zero-padding and "negative left arg means take from end" behaviors while golfing my BQN answer to How many times can I skip a stone. But of course I'm not enough of an array programmer yet to realize that a number could act like a single-element array.
@Adám I'm not enough of an array programmer yet to state that equivalence confidently. ;) (And I think the details are a little different in BQN than in APL? I didn't understand that part.)