« first day (2826 days earlier)      last day (2018 days later) » 

1:24 AM
@DJMcSpookem is there a brain-flak self-interpreter?
 
@NewMainPosts i feel like this person came out of a wormhole from the 1980s
be like "what is the cheapest C compiler nowadays?"
 
@ConorO'Brien Does this fit the bill?
 
@quartata A better question would be "Are there benefits to using a non-free C compiler?"
 
1:44 AM
@Οurous A better question would be "Are there benefits to paying for WinRAR?"
 
@Quintec Yeah, I don't need to close the prompt when I open it and I get that warm fuzzy feeling.
 
@Οurous I seriously hope you're joking, otherwise a) you use WinRAR b) you're proud of it c) you paid for it :P
Mostly just a)
 
@ConorO'Brien Yeah, what dlosc said
 
@NathanMerrill Thanks for comments, well I think that's quite complicated too but I'm afraid of hiding too much crucial information
 
2:29 AM
@ShieruAsakoto I know, I deal with the same problem too
You want your spec to be comprehensive, but understandable
However, in your particular challenge, there's a lot of stuff going on
tons of different actions, equations, etc
That's not a criticism:
Rather, it's a tradeoff: Complicated means less submissions
 
@ShieruAsakoto In relation to Nathan Merrill's comments: While I understand restricting it to a specific language, and while JS is widely written, the subset of people who: write JS, have the time to write complicated things in JS, and can understand the challenge - will be fairly limited. You're likely to get some low-effort just-qualifying submissions and only a few more interesting ones.
 
Maybe I should put the concrete formulae into a reference part instead? I still want to make the reasoning behind the formulae clear though.
 
@ShieruAsakoto That's a good idea. That way people can read more if they want to understand it, but spend less time before being able to start on a solution.
 
 
2 hours later…
4:17 AM
Who remembers TeamSpirit?
 
why the colors :o
 
It was a userscript that split TnB into two teams based on arbitrary conditions
 
4:32 AM
0
Q: Read out the C variable declaration

BubblerBackground Variable declaration statement in C consists of three parts: the name of the variable, its base type, and the type modifier(s). There are three kinds of type modifiers: Pointer * (prefix) Array [N] (postfix) Function () (postfix) You can specify a list of function arguments insid...

 
4:44 AM
@ATaco I still have a version of it installed on my surface that I barely use
 
5:24 AM
O_o what does it mean for a bounty to be placed by community?
 
5:37 AM
I don't know, but I'd guess the user that placed the bounty deleted their account
@Downgoat Where did that happen?
 
5:55 AM
saw it on history.se forgot the exact post
 
I devised a quick-and-dirty method for measuring how popular a language currently is on PPCG. Search is:a language-name, sort by Newest, scroll to the bottom, select 50 results per page, and check the date of the 50th-newest answer.
Pros: easy to do, doesn't require special privileges. Cons: prone to false positives, doesn't work well for single-character or symbolic language names.
Some current results:
Python:     Oct 20
JavaScript: Oct 13
Jelly:      Oct 7
APL:        Oct 5
05AB1E:     Oct 2
PowerShell: Oct 2
Ruby:       Oct 1
Java:       Sep 20
PHP:        Sep 13
Pyth:       Sep 7
Retina:     Aug 25
Stax:       Aug 17
MATL:       Aug 8
Julia:      Jul 5
MATLAB:     Jun 11
CJam:       May 17
Befunge:    Apr 7
QBasic:     Mar 12
4
 
6:14 AM
Jelly: Oct 7
suprised
 
Surprised that it's that popular, or that it's not more popular?
 
that is almost as popular as common programming languages
 
 
2 hours later…
8:01 AM
@Downgoat If a bounty is awarded by the Community user, it means that it was defaultly awarded to the highest voted answer, and not awarded by the person who set the bounty
 
0
A: Sandbox for Proposed Challenges

Евгений НовиковHack g-code parser Here you can see g-code parser, written in JavaScript to use in microcontoller(like espruino). But you can run it in browser, because it don't use any specific features function gcode(str){ //Removes comment, parses command name and args const [,f,args] = (str.match(/...

 
8:27 AM
in Mathematical Programming Challenges, Oct 16 at 5:38, by user21820
Pretty Programming Puzzle: RoboZZle.
It's essentially code-golf in a minimalist programming language. If anyone here can solve the puzzles I linked to in that room, could you share or hint? I can't figure out what I'm missing.
 
@user21820 time to jump in the deep end XD
 
ngn
@user21820 come on, the first one is really easy - try to solve it in a function with 4 instructions, then split it
 
Huh, Charcoal only slightly more popular than... MATLAB
 
O_o
 
@ngn Are you referring to the right one?
I can solve all those not labelled "Hard".
 
8:36 AM
also. sorry about not touching Charcoal at all for the past who knows how many months lol
 
ngn
@user21820 ah... i started from "Easy"
 
@ngn =)
 
the thing about writing fastest-code challenges is that I get to work out how to install and run languages I had never even heard of before :)
 
ngn
8:52 AM
@user21820 i solved the first hard one
 
@ngn Can you post a hint in the room?
 
@ngn O_o
 
ngn
@user21820 sure
 
 
5 hours later…
2:09 PM
@Dlosc golfed what 78 bytes? Wrong person?
Oh, nevermind
My answer on the hello world challenge
 
 
1 hour later…
3:12 PM
0
A: Sandbox for Proposed Challenges

CowabungholeIs this number secretly Fibonacci? I can't think of a good name for this challenge, so let me know if you think of anything. Most of you know what a Fibonacci number is. Some of you may know that all positive integers can be represented as a sum of one or more Fibonacci numbers, according to th...

 
0
Q: Smoothing a pair of arrays

Seanny123Summary Given I have two lists with binary values of equal length=>3, return a pair with an identical sum, but with minimal forward difference. Forward difference [1] being the absolute difference between items. For example: [0, 1, 0] would be sum(abs([1, -1])) => 2 [1, 1, 1] would be sum(abs...

 
3:34 PM
@Criggie You can't lose the password if you become the password. This is what Rg7x did! — Agent_L 58 mins ago
 
@NewMainPosts I don't entirely understand the challenge, but FṢṁ works for almost every single testcase
 
and that's what might cause your solution to actually have to be an order of magnitude larger...
 
Sorry about the bad question. I'm editing it now.
Do you have a meta question of acceptable win conditions?
Like, if I want to define a performance win condition, do I also need to specify a language?
 
@Seanny123 Hey, welcome to the site!
Generally, the win condition is Shortest code wins
 
welcome! :-) for starters, you can refer to this
 
3:45 PM
But there are various other ones you can do (fastest code, lowest complexity algorithm, something else entirely) but those are harder to get right
 
If I say "fastest code", could/should I also say "fastest Python code"?
 
restricting languages is discouraged
 
Understood.
 
also, "fastest code" requires that all submissions be tested on one computer
 
is also going to be very difficult to judge with the challenge as-is. All of the test cases are small enough that they would complete within milliseconds; well within error margins.
 
3:50 PM
Yeah, I'm feeling this as well. I'll stick to code-golf.
 
btw, if you don't want to be anxious about your challenge being acceptable, here is a sandbox :-)
 
I think I've got a handle on it now? But I appreciate your kindness and consideration.
 
@Seanny123 you're welcome :-) btw, DJMcSpookem has asked a couple questions in the comments, the challenge is a bit unclear currently
 
Yep, gonna make one more edit before flagging it for reopening.
 
flagging it? nah, I don't think you need to do that :-)
maybe post something here along the lines of "I think my challenge is clearer now, could you please consider whether to vote to reopen it or not?"
it's not just the mods' opinion that matters here
 
4:03 PM
@Seanny123 It is looking better, but I'm still not sure about one thing.
([1, 0, 1, 0, 1], [0, 0, 0, 1, 0])
=>
([1, 0, 1, 1, 1], [0, 0, 0, 0, 0])
 
yeah, that
 
> The sum of both arrays pairs is 6.
How is that?
 
might've counted zeroes instead of ones...?
also, why not ([0, 0, 0, 0, 0], [0, 1, 1, 1, 1]), which I think has an even smaller "forward difference"?
 
oh god, I failed at arithmetic
 
@EriktheOutgolfer That depends on what the "sum" is. If it's the number of 1s, that works, but if it's the elementwise sum it does not
 
4:05 PM
it can't be the element-wise sum as the challenge is defined
sum(smoothed_a) + sum(smoothed_b) implies that the two lists are summed separately first and then the two sums are added
 
Actually, I think the problems may go deeper than this... I have to go offline and do some thinking. I'm going to delete the question and get back to you.
 
Oh I mist sum(list_a) + sum(list_b) == sum(smoothed_a) + sum(smoothed_b)
*missed
@Seanny123 FWIW, I think if you removed list_a[i] + list_b[i] <= 1 and made it about elementwise sums, it would be very interesting
With the way it is now, you just want to sort the two lists so all the 0s and 1s are grouped together, which is fairly easy. If you have to make sure the elementwise sums of the new lists are the same, that becomes more challenging
 
yep, I can prove that it would not be just a matter of sorting each list and outputting the two sorted lists
 
Yeah, cause ([1, 0, 1, 0, 1], [0, 0, 0, 1, 0]) counters that
 
([0, 0, 1, 0, 1], [1, 1, 1, 0, 0]) too
(the counterexample I used)
 
4:13 PM
Yeah, I forgot the contraint wherein the only valid operations are swaps, like list_a[i] = list_b[i] and list_b[i] and list_a[i]. Which no longer makes this an interesting question, so I think I'll post it on codereview.stackexchange.com
Gah, making internal assumptions explicit is not something I am well practiced in.
 
No worries. Writing good challenges is really hard, it takes a lot of practice.
 
@DJMcSpookem I'll edit the question to remove that constraint to make it interesting.
 
@Seanny123 you mean like Python-style list_a[i], list_b[i] = list_b[i], list_a[i]?
 
CMC (inspired by Seanny's challenge): Given an array of arrays of integers, where each sub-array may have a different length, rearrange the integers so that the absolute sum of the consecutive differences of each sublist is as small as possible.
 
ẎṢṁ :-P
 
4:16 PM
The overall shape must stay the same (each array must have the same length as before)
@EriktheOutgolfer That doesn't work in this case.
Let me think up an example
 
@DJMcSpookem um, yes, it does, the differing lengths aren't an issue for ;-) or is there another issue?
 
There's another issue
 
@EriktheOutgolfer yeah, like that Python-style constraint.
 
@DJMcSpookem what? explanation: concatenate all the lists into one, sort, mold to form the shapes of the original lists again
 
I know, give me a second.
Alright, so for the input: [[4, 8], [15], [16, 23, 42]], your code will return the same thing: [[4, 8], [15], [16, 23, 42]]
let "f(l)" = sum(abs(i) for i in intervals(l))
f([4, 8]) == 4
f([15]) == 0
f([16, 23, 42]) == 26

score == 30
[[4, 8], [42], [15, 16, 23]]
f([4, 8]) == 4
f([42]) == 0
f([15, 16, 23]) == 8

score == 12
@EriktheOutgolfer Does that make sense?
 
4:21 PM
yeah, my brain was stuck to binary for some reason
 
Well the binary doesn't matter as much as the fact that sublists could have length 1. And also that the differences between the end of one sublist and the start of the next aren't relevant.
 
well, I guess I can brute-force that :P
 
4:38 PM
Alright, I gave it one last shot, mostly because I don't know when to quit.
Can't tell if it's simplistic or not.
 
it does look a bit simple currently, if you want my opinion
 
It looks clear to me. I've reopened it
 
5:03 PM
@EriktheOutgolfer Doesn't work for me. Try it online! :p
 
and that's why code formatting is important (not that it works anyway...)
 
hahaha
 
also, your ping got to my inbox the moment I heard it
 
That's weird
 
@AdmBorkBork I know you're joking, but you want to put the list in the arguments, not input
 
5:06 PM
it has happened sometimes, but generally I don't think the quicker notifications setting should make pings appear in your inbox in 0 seconds...
 
@DJMcSpookem I can never remember which languages want input in which fields...
 
Jelly, Husk, Dodos, etc. take input from the arguments, others do so from STDIN
happy now? :-)
 
lol
Oh, sweet, I passed 25,000
 
But do you have 100 questions yet?
:P
 
97 questions, 93 Socratic
 
5:13 PM
Would it help you get socratic sooner if I threatened to earn a second one? I'm a ways off, (understatement) but I could pretend I'm making progress
 
I think a better threat could be if PPCG would die entirely if not for Adm's questions ;-P
 
Oh dear, lol.
@DJMcSpookem No, it's just getting tougher and tougher to come up with challenges that aren't
I mean, I can keep doing ascii-art challenges (I am one of the top-askers for that), but they're getting boring and/or tedious.
 
@AdmBorkBork yespls :p
 
@AdmBorkBork your challenges are quite good, generally
 
I do like KC challenges. My favorite challenge I've posted is Known Knowns
 
5:28 PM
ah, yeah, that truth table :P
 
Indeed, haha
 
that was actually clever
 
5:50 PM
1
A: Sandbox for Proposed Challenges

Kevin CruijssenSplit it. But not all! code-golfstring Inspired by this StackOverflow question. Input: We'll take three inputs: A delimiter-character D to split on A character I within we ignore the character to split on (I know, that sounds vague, but I'll explain it below) A string S Output: A list/ar...

0
A: Sandbox for Proposed Challenges

l4m2Given a program in your language, generate another program that do exactly the same thing so every bytes in it are prime. Shortest generator in every language win. No acception. Nop in languages that only allow prime bytes are legit, but just don't post them(or make a community answer to put t...

 
6:08 PM
0
Q: Choose an Outcome for Maximum Drama

Stephen LeppikThe premise of this is simple: A 10% chance is pretty unlikely, but everyone knows that a one-in-a-million chance is a sure thing! So, write code that implements the following "dramatic" probability rules: Take in a floating point P from 0 to 1 representing the unmodified chance of some plot-r...

1
Q: New Neighbour Sequence

LaikoniThe non-negative integers are bored of always having the same two* neighbours, so they decide to mix things up a little. However, they are also lazy and want to stay as close as possible to their original position. They come up with the following algorithm: The first element is 0. The \$n^{th...

 
6:20 PM
@dzaima There. New challenge for you. ;-)
 
Happy early birthday :P
 
:D
 
Haha, thanks! Today is my unbirthday, donchaknow.
 
0
Q: Bake me a slice of cake

AdmBorkBorkMy birthday is in a month, and this is a slice of tasty cake. .-""-. .-" "-. |""--.. "-. | ""--.. "-. |""--.. ""--..\ | ""--.. | | ""--..| ""--.. | ""--.. | ""--..| In the fewest number of bytes, con...

 
CMP: What's your socratic progress ÷ total challenges posted percentage? (if you haven't posted any challenge you score 0)
 
6:27 PM
95.92 (as soon as ^^ that one counts for Socratic)
 
@Mr.Xcoder How do I find that out if I already have socratic?
 
¯\_(ツ)_/¯
If you already have socratic, you score +∞.
@Mr.Xcoder 89.7%
 
I mean... Not necessarily. Like If I posted 2 questions a day (all upvoted non closed) for 100 days, I'd have 50% but still 1 socratic
 
@Mr.Xcoder 82.4%
 
@Mr.Xcoder 92.6%
 
6:35 PM
@dzaima That was ... rather quickly posted.
 
@AdmBorkBork well, it was an automatic compressor
also, ಠ_ಠ I somehow still don't have a "replace" command in Canvas...
 
CMC: Given two of the unit vectors corresponding to the Ox, Oy, Oz, -Ox, -Oy and -Oz axes, namely i, j, k, -i, -j and -k, return their cross product. Test cases: (i, j) -> k; (j, i) -> -k; (k, i) -> j; (i, k) -> -j; (j, k) -> i; (k, j) -> -i; (-j, i) -> k; (-j, -i) -> -k (note the anti-commutativity)
 
@Mr.Xcoder 100% (but I only have 5 questions posted, so...)
 
6:52 PM
@Mr.Xcoder This is proving surprisingly difficult ... or maybe I'm just dumb. :-/
 
RAD will eventually get cross-product ... I think. I'll probably work on it in 2019.
I'm surprised that none of Jelly, 05AB1E, nor Seriously/Actually have a builtin for this
 
@Mr.Xcoder Mathematica: i={1,0,0};j={0,1,0};k={0,0,1};Cross
 
@Pavel Why not just Cross and take input as vectors?
 
@Adám I assumed it had to be i, j, and k
There's also a cross operator but it's symbol it's in the unicode private use block
 
@Mr.Xcoder APL (Dyalog Unicode), 23 bytes ((1⌽⊣)ׯ1⌽⊢)-(¯1⌽⊣)×1⌽⊢ (Official formulation; can probably be golfed. Assumes input as vectors.)
 
7:15 PM
@Mr.Xcoder APL (Dyalog Unicode), 16 bytes -/×⌿0 1⌽1 ¯1∘.⌽⎕ (input as list of two vectors)
 
7:26 PM
@AdmBorkBork lol
aaargh, that challenge is very difficult for most languages out there
yep, Arnauld is magic
 
7:47 PM
Any language with a buggy determinant function?
Is this already a challenge on main?
 
@Zacharý buggy?
 
As in ... one could use that informal determinant-trick to implement the cross-product.
 
@Zacharý NARS and J have f.g for determinant.
@Zacharý Did you see my innermost product?
 
Yeah, that's pretty neat!
 
8:12 PM
My goodness, I was just reading J's docs/wiki ... APL backronym as Array Processing Language
 
@Zacharý Yup.
 
@Mr.Xcoder All 5 of my posted challenges count towards socratic, I think
 
ngn
8:54 PM
@Adám (¯1⌽+)×1⌽-
 
@ngn Beautiful — and very clever (only works for 3D though, but that's the CMC, so you're good)
 
I thought cross product was only 3D in general...
 
ngn
oh, silly me... (2⌽+)×1⌽-
 
@ngn Yes, of course! But the original has a certain beauty in its symmetry.
 
ngn
¯1 is 2 (mod 3)
 
9:02 PM
Ooh, wait a minute, isn't this +.×+× if the arguments are quaternions, e.g. using NARS?
 
ngn
@Adám if the arguments are quaternions, it's × :)
 
Oh, NARS.
 
@ngn Oh yes, because +.× will be 0.
 
ngn
oh, silly me...
1⌽-×1⌽+
 
@ngn Oh, now it is beautiful again!
@ngn Still longer than Cross though.
 
9:43 PM
Proposal for Newbs Q&A closed as duplicate of Stack Overflow
 
@mbomb007 rip
@mbomb007 ∴ Stack Overflow ≡ Newbs ∎
9
 
0
Q: How to restrict/convert an ease formula's results to 0 - 100 bounds?

Livy ChopeI have a formula that I wish to transform its results to a range of 0 - 100; 'so no matter what data is entered, it always falls between those bounds' t = current time b = start value c = change in value d = duration -c * (Math.sqrt(1 - (t/=d)*t) - 1) + b The input values will be lineal, and ...

 
@NewMainPosts sigh
 
5 mins ago, by mbomb007
user image
 
 
1 hour later…
11:22 PM
0
Q: Creating a decoder for the "foo" encoding

connectyourchargerI have created an encoding method called the "foo" encoding. It uses a special algorithm that I created to encode any string into an encoded string that uses the keywords foo, bar, baz, fo, br, and bz. Let's say I input the following into the program: Noodle pie is delicious. I will get th...

 

« first day (2826 days earlier)      last day (2018 days later) »