« first day (3287 days earlier)      last day (26 days later) » 

12:00 AM
I understand that it is the only possible answer, but the input could actually have no solutions (i.e. incorrect values on non-diagonals).
Then I think the right approach should be either numerical approximation (e.g. least squares) or DOMAIN ERROR.
 
@Bubbler Sure, but f⍣X⊢Y for negative X runs f⍣(-X) on its candidate result before it returns it, and checks that the result of that is identical to Y. If it isn't, it gives a DOMAIN ERROR.
 
That makes sense then.
 
(except if it knows that there is always a solution).
 
(this is my cheating solution)
 
@dzaima Same as {0≤⊃⍵:←-⍵⋄+\-⍵}, no?
@dzaima Doesn't that fail if 0=⊃⍵?
 
12:07 AM
@Adám it does for your modification
 
Ah, I see now.
 
12:36 AM
0
A: Sandbox for Proposed Challenges

RGSCan I enter your music box? This code-golf challenge would require users to write a function that takes a string as input and returns a Boolean, indicating whether or not the input string can go in my music box. To be able to make such a decision, users will be given two files. One with plenty ...

 
 
2 hours later…
2:26 AM
0
Q: Elastic collisions between blocks

Peter KageyThe 3Blue1Brown Youtube channel released a video a year ago called "Why do colliding blocks compute pi?" which describes a model where a block A of mass \$a\$ slides into a block B of mass \$b\$, which then pushes block B into a wall, causing it to bounce off the wall and then collide again with ...

 
3:21 AM
Why didn't anyone use Husk? It's a very concise language with lots of possible interpretations for a single operation.
 
It has been used a fair amount
Golfiness is not the only attractor to a language though.
 
 
4 hours later…
7:53 AM
Because Husk is inspired by Haskell/is a functional language
and people would rather use languages with paradigms they are familiar with
 
Pyth, which is also prefix (similar to Husk), has a lot more usages than Husk, and yet has a higher learning curve (based on my unscientific testings.)
 
Pyth is just chaining imperative functions, just like postfix stack based languages
Husk has functional concepts like repeated type inference
"flow control constructs, like for loops and if statements, don't exist in Husk. Instead, you use higher-order functions and recursion."
This would already deter most people from learning it
 
(Side note. They don't really provide much abstraction over for loops. Map is just a for loop that returns its results.)
The functions should be easy to understand with the examples.
Husk provides composition of instructions, which is quite similar to chaining.
 
8:47 AM
So what stuff in Husk made it so concise?
 
 
5 hours later…
1:26 PM
CMC Given a board of size 2ⁿ, show all of the T(n!) sets of connected polyominoes that can be arranged to cover all but one square of the board, whichever square is chosen. Output can be in a descriptive format but ascii-art also works.
 
1:59 PM
sorry, forgot to mention that there are three polyominoes in each set
 
 
4 hours later…
RGS
6:22 PM
Guys, can you add your opinions to FryAmTheEggman's on this challenge? codegolf.meta.stackexchange.com/a/18493/75323
 
7:00 PM
-3
Q: Why did the answer differ here? big o

tsukumo 823Why did the answer differ here? Void foo( int n) If (n<=1) Return Dooh() big o(1) Foo(n/2) Foo(n/2) Answer O(n) Void foo(int n) If (n<=1) Return Doohd () big o(n) Foo(n/2) Foo(n/2) Answer. O(n log n)

 
7:26 PM
hello!
anyone here understand Julia? I am trying to write my first piece of code. I am writing this simple code bpaste.net/T4MQ but it says minsofar is not declared. How should one do this in julia?I clearly don't know what I am doing
 
7:50 PM
I think I cracked it :)
 

« first day (3287 days earlier)      last day (26 days later) »