« first day (2339 days earlier)      last day (2505 days later) » 
00:00 - 14:0014:00 - 00:00

12:00 AM
in talk.tryitonline.net, 7 hours ago, by Dennis
The changes to output cache are now live. Loading a permalink automatically fetches the result from cache (if it exists). Pressing the Run button bypasses cache and actually runs the code.
 
@Dennis Ah, that's why. I was wondering.
 
Wait ... if you have function that can change the result?
 
I feel stupid, disregard my last comment.
 
@ZacharyT The one which Pyth has which you don't have is O, which multiples the complex number by a random float between 0 and 1. I've never seen it used, so you probably shouldn't add it.
 
12:12 AM
That ... seems useless.
Oh crap, random!!!
Crap!
Would it be reasonable to do like jelly does and have a random choice, or should I add a random between numbers somehow?
 
I'm gonna try that automorphic number challenge, but I need to figure out modulus (should be simple) and length of a number
 
In which language?
 
Sad-Flak
I think it will be division for length
also I think for arbitrary modulus, I need to figure out square root
 
Jim
@isaacg How do you test if a string starts with a prefix?
Like .startswith() in Python
 
xzQ
0 if yes, nonzero otherwise
Where z is the string and Q is the prefix.
 
Jim
12:17 AM
@isaacg Thanks!
@isaacg Wait, shouldn't x return the first occurrence of Q in z?
Oh, sorry
I got it
 
brb implementing square root in Sad-Flak
 
@DestructibleLemon I'll do it in brain-flak for the heck of it. Is input guaranteed to be a square?
 
@DJMcMayhem I have that lying around somewhere (for input may not be square).
 
@DJMcMayhem yes
 
Don't show me yet
I wanna do something similar to my last brain-flak answer
(difference to next square)
But I'm gonna write it from phone
 
12:29 AM
@DJMcMayhem even better, use a T9 keyboard to type it
 
You are going to write that from your phone!? If you can do that I will be extremely impressed.
 
it is probably easier in brainflak
by easier I mean shorter
 
Hmm
Somebody do it in brainfuck
That would be impressive too
Also, out-golfed by xnor
Every single time ;-;
 
@WheatWizard Try it online! Pretty damn short too, if I do say so meeself
 
12:33 AM
@DJMcMayhem Ah you get to assume the input is square.
I can do that in 20. You want to see?
 
Yeah. That would be a lot harder otherwise
@WheatWizard holy crap! Sure.
 
Beautiful
That should have been obvious
I feel like anytime ({}) exists in a chunk of brain-flak code, but isn't extraneous, the answer is always impressive
Popping empty stacks is another really used but super cool trick
 
Its used for trippling stuff pretty often
or even doubling (({}){})
 
this was my first attempt
 
12:37 AM
Question: what should compiler-found errors be called (Compiler Errors? Syntax Error?)
 
That's true, but it looks different just sitting by itself
 
example: var a: Int = "test"
like you can't assign string to int
so should i call that a syntax error like java
 
Probably not
 
@WheatWizard how long is your answer that works for non-squares?
 
12:38 AM
@Downgoat I think you can. It's a wrong grammar after all
 
Generally I would say that syntax errors, should be for when a program is not spanned by the languages grammar
@DJMcMayhem I'll have to find it, give me a second
 
hmm, you have shown me my way was backwards
 
@DJMcMayhem I just found this which gave me a chuckle
its not at all golfed
 
2.44??
sqrt(6)=2.44948974278
wow, float.
 
the 3 is digits of precision
 
12:41 AM
sure
 
Oh, I was just thinking it would be integer square root
 
how would that work for non-squares?
 
taking your golfs, I have gotten my square root down to 29 bytes
 
@WheatWizard That is pretty funny. It's also cool to see how far the brain-flak population has gotten. Until recently, there's no way I could have written my 30 byte equivalent, or even comprehended your 20
@WheatWizard just floor(sqrt(n))
 
Hm, I can't think of a clever way of doing that
 
I feel like it could be done in 80-ish
 
I have improved by using wheat-wizards thing
@DJMcMayhem it definitely could
I know how
actually it could in sad-flak
I'm not sure in brainflak
it could work in sad-flak, but not brain-flak?
how long is a program to determine if a value is truthy in brainflak?
 
@DestructibleLemon BTW, I just looked at sad-flak docs. I don't know anything about woefully, but sad-flak looks awesome! I'm very impressed :)
 
@DJMcMayhem thanks
a sadflak to do floor(sqrt(n)) might be shorter than the brain-flak program
mostly because of multiplication? IDK
possibly not
but it involves doing square roots of squares, then checking if the values are equal to the original number
 
@DestructibleLemon one question though: when does jump happen? You said that anything after the jump is still executed. Does this mean (())≤()≥ and ≤()≥(()) are exactly equivalent?
 
12:49 AM
basically you figure out when it goes negative, then return, subtract one
@DJMcMayhem yes
 
@DJMcMayhem Here's ceil(sqrt(x)) in exactly 80 bytes.
 
and they can both be golfed to
 
Ok. Or better yet ≤(())≥
 
(≤()≥)
@DJMcMayhem ninja'd
 
Almost
Slightly different
 
12:50 AM
actually I'm not sure who got ninja'd or whether we both did...
 
No one. We had different snippets
 
@DJMcMayhem anyway, the entire line is always executed each time
 
What would ≤()≥≤()≥ do?
 
o0 you keep golfing in decrements of 10
 
12:58 AM
@DJMcMayhem ≤()()≥
the line pointer is separate from the ip, as you might call it
the line pointer points at the next line, not the current line
 
this answer seems to be asking "why not?"
 
(<>){{}}≤≥
that is a square number program
beat that, brainflak
 
that's a bad comparison
:P
 
um, the brainfuck to sad-flak is pretty easy?
nah probably not
any easier
um, it doesn't take 3 bytes or 1 byte for ascii input?
actually that isn't it
(<>)({{}})≤≥
fixed
the square+n is easier even
 
@ASCII-only I think I figured out what is porblem in VSL tokenizer, whatever is tracking the position is ignoring spaces. idk why though, the tokenizer code looks fine
 
1:07 AM
actually, I might be able to make a square root just by checking all the possibilities
 
@DestructibleLemon That's a really good distinction to make. You should clarify/name both of those in the docs, it'll make it a lot more intuitive. Something like The LP is the current line counter. ≤N≥ increments the line counter by N. The IP is the line currently being executed. It's always the first non-empty line after the LP
 
ok
will do after I finish floor root
I posted the wrong link in chat!
 
oh noes
 
1:35 AM
aaaaaahhhh google material design guidelines say "don't avoid <bad stuff>" so much and it annoys me >.<
 
Question: Does anyone know difference between PCRE and PCRE 2
I can't find an exact list of changes
 
@HyperNeutrino Context?
 
I mean, it's not exactly "don't avoid doing this", it's more like:
------
Don't
Avoid doing this
 
@WheatWizard this does ceil(sqrt)
 
yes, that was the intention
 
1:48 AM
o
 
(see the message before that one)
 
@HyperNeutrino That's not context...
 
@Dennis Did you want a link?
 
there are do's and don'ts, and the don'ts use words like avoid, with double negatives
 
1:53 AM
darn i closed it
^^ yeah that's what i meant
 
@HyperNeutrino Well, if you're talking about it, you might as well show us what you're talking about.
 
and then Ctrl-F "Avoid"
It's not really a double-negative the way they intended it but it looks awkward, at least to me.
 
things that sad-flak does not greatly: nested loops
 
Don't: Avoid using the term avoid in Don't sections.
12
 
>.> but yes :P
Don't: To avoid confusion, avoid "avoid" in Don't sections and don't avoid not creating double negatives.
 
2:04 AM
@HyperNeutrino let's make a CMC
 
ooh sure.
Did you set your profile picture to transparent?
 
no I didn't
 
...
either you did or my computer is being weird
 
my avatar is imported from facebook
 
oh wait it reappeared
 
2:07 AM
so there might be some difficulty displaying it
@HyperNeutrino and by "let's" i mean "you"
 
ah i see
@LeakyNun >.< ok will try to think of one
 
lol
 
CMC: Given a list of words, output the string formed by taking the first letter of each string (lol this is probably too easy, I'll try to think of a better one)
Hyper Neutrino -> HN, Leaky Nun -> LN
 
@HyperNeutrino I believe òldw would work in V
I haven't tested it though
 
2:12 AM
Cool
 
lambda s:''.join(i[0]for i in s.split())
 
@totallyhuman lambda s:''.join(zip(*s.split())[0])
 
Pure regex solution is much longer: Try it online!
 
@DJMcMayhem o i c. also too many unprintables :P
 
True
Expanded is :s/\<.\zs.\{-}\>\s*//g
 
2:16 AM
uh wat
this just deletes everything except the first letter of every word?
 
Yeah
 
@HyperNeutrino Thats real clever, It took me a while.
 
Ah. Cool.
@WheatWizard thanks :) yeah zip is cool
 
@HyperNeutrino APL: ⊃¨ Explanation: first of ¨ each.
 
I love zip. The zip splat combo is genius. I should golf in python 3 more often
 
2:19 AM
@HyperNeutrino Jelly, 3 bytes: ḲḢ€
 
I personally find the zip splat combo annoying. Personally zip(list) would be much shorter, and much more commonly used.
@Adám Nice. Wow shorter than jelly
@DJMcMayhem implicit '' joining :))) :P
 
Does anyone else have a light hearted debate about anything rly and people just assume you really care about what is going on? It is super annoying, people can't have light hearted debates anymore
sheesh
 
@HyperNeutrino I think the APL and Jelly solutions interpret list of words differenly.
 
@HyperNeutrino I prefer the current behavior. Most the time I am just doing zip(a,b) in which case it would be annoying to have to use the [..] every time
 
@HyperNeutrino There's no joining involved. Jelly's strings are lists of characters internally. Jelly doesn't have a dedicated string type.
(Unless you exploit some bugs.)
 
2:22 AM
Oh. Nvm then :P (I remember you posted something about a bug exploit for golfing that would break normal programs but could be used to golf)
@Dennis Hm. Interesting. I find myself using zip(*array) much more often. Maybe depends on what we use it for :P
 
Yeah, this shouldn't happen.
 
Oh yeah, I guess I don't need to split
 
Strings in Anyfix are just Python strings :P I'm not sure if that would eventually cause issues but I'm not going to continue working on it anyway.
 
How come?
 
How come I stopped working on it, or how come it might cause issues?
 
2:27 AM
The former.
 
the dwarf fortress wiki has got to be the best wiki ever:
> Diggor Mortis: when a Dwarf with a pickaxe decides that digging where they shouldn't is a bloody good idea.
2
 
Ah. It's because the Anyfix Notation is too hard to use, and the way the language is structured, it doesn't actually add anything to Jelly. For many simple problems, Jelly answers will actually work in Anyfix, and for harder problems, Anyfix can't do them without like 10 stack swap operations.
I had another idea similar to a tacit structure that I'd like to do instead that would be able to do more complex tasks.
 
@HyperNeutrino what was going on with your account?
 
iirc it was tl;dr: somebody thought he was under 13 based on something he said, and reported him to SE, who froze his acct, but he got it un-nuked and we're all good now
 
It got deleted due to age restrictions, then merged back into my chatbot account after I contacted SE and they found out it was a mistake on their end.
@Riker not frozen, deleted
42649 no longer exists
 
2:33 AM
@HyperNeutrino Oh man. Because you were <13 when you created your account?
 
Yes :I You remember from chat, right?
TL;DR, they just went into the database and set the owner for every action that 42649 ever did to my current account.
 
Except votes. :(
 
Deleted posts aren't included, so none of my deleted posts belong to this account any more :D
 
you should just go back through all of PPCG and vote on everything the same way
 
@Dennis Yes, unfortunately :( I contacted them asking about that because it affected like literally everybody here, but they haven't contacted me back about anything yet.
@musicman523 I'd get rate-limited really hard, and it would be quite difficult to replicate it.
Caret Reply doesn't work well when there's lag :(
welp gotta go finish up something, be back in about 15 minutes
ಠ/
 
2:37 AM
@HyperNeutrino I wouldn't worry about it, as far as I know noone lost more than 200 rep. So its really only a days worth of rep. We're just glad you got your rep back :)
 
So the widely held assumption that there is a 0-day statute of limitations on being under 13 is not true?
 
@WheatWizard Thanks :) But yeah, still kinda disappointing.
@feersum What exactly do you mean by a 0-day statute of limitations on being under 13?
 
2:52 AM
Once you're 13, you're no longer under 13.
 
That seems....true.
 
@Dennis Prove it!
 
@Adám 13 < 13 is false
But wait so as long as they don't catch you before your birthday, you're safe? :P
 
Now prove it in Propositional Calculus.
 
@HyperNeutrino Not true: tryapl.org/?a=13%3C13%3D0&run
 
2:56 AM
:o looks confusing
@Adám sigh this joke again? :P
 
@Adám We should have a program to check them. I'd do it but my computer is currently checking all the even numbers to make sure there aren't any primes hidden somewhere.
4
 
please, try more obvious star trolling I love it
 
Let me guess, < is not less-than?
 
Way off.
 
@HyperNeutrino It is. ANd = is equals.
 
2:59 AM
Now, if only the site would load...
 
@HyperNeutrino What site?
 
The tryapl link
 
@HyperNeutrino Really? Works for me.
 
Finally loaded >.>
 
@HyperNeutrino Try it online!
 
3:02 AM
But 13<13 gives 0.
...
@Adám Nice try
 
@HyperNeutrino Took you a while.
 
OK, but why does that happen?
 
@Adám To be fair, I went to keep working on my website until I realized "wait, order of operations" :P
 
i think the divisor sum question needs a fastest code challenge
@Dennis
hint, hint :-)
 
Ah, that could be fun.
 
3:15 AM
I just upvoted a bunch of the answers on that challenge. I really hope I don't get tracked as serial voting because like 75% of the answers belong to the same user >.>
 
@xnor Just to be clear: you're saying I should make one?
 
yup
 
Good. Wouldn't want to steal your idea because of a misunderstanding. :P
 
Does anyone here play Infinifactory?
 
@Dennis twas your idea :-)
 
3:17 AM
Wait (x,y)->¬((x|y)&¬(x&y)) is an RO? hm i feel dumb lol
 
Ha! Yeah, sort of.
 
@HyperNeutrino That after being over 13, you would not be banned for using the site while under 13 at some point.
 
Question: does windows support rm -r?
 
Ah. Okay. Well, some people might have not seen pursuing undeletion worth it, especially lower rep users, and in fact if I had kept my "mouth" shut in chat I might not have been noticed, but that's probably not a rule since I was allowed to continue on SE
Also I just realized something awesome :D
Since I got my account deleted and only recovered PPCG, SO, and Math, that means that I no longer have any affiliation to CR! :D
(cc @Mego) I managed to wash away the heresy; I think the 600 degree shower worked :D
 
CR==Code Review?
 
3:21 AM
yes
 
why're you happy that you're gone from there?
 
it's a joke :P CR is that weird place where they care about readability; here, we just care that it's short
 
I didn't ask to recover CR even though I had +3/-0 answer score total there
 
3:45 AM
I'm gonna make a new square root in sadflak
hmm, it will be different if 0 is valid...
this is harder than I thought
 
4:30 AM
> The best thing about a boolean is even if you are wrong, you are only off by a bit.
lol
 
18
Q: Proper Divisor mash-up

Mr. XcoderA proper divisor is a divisor of a number n, which is not n itself. For example, the proper divisors of 12 are 1, 2, 3, 4 and 6. You will be given an integer x, x ≥ 2, x ≤ 1000. Your task is to sum all the highest proper divisors of the integers from 2 to x (inclusive) (OEIS A280050). Example (...

someone upvoted every one of my answers here
and then i hit repcap
 
that would be me; I upvoted like almost every answer there :P
not all of them but most
 
4:51 AM
I'm back. my mum took the computer and xbox controller because i didn't want to do the stupid stemcel thing
controllers*
my kindle has abrowser
 
5:18 AM
0
Q: Burninate Kolmogorov-Complexity

Challenger5According to the tag wiki, this is kolmogorov-complexity: Kolmogorov complexity, informally, is the amount of code it takes to describe or produce a constant object, such as a string or image. It's scope was broadened by this Meta post, in which the consensus was that KC questions that take...

 
5:41 AM
What is a repcap?
 
You can only get 200 rep per day.
(Ignoring bounties and the rep bonus from people accepting your answer).
 
@Dennis alright then I'll use the term :P
 
 
2 hours later…
8:14 AM
@LeakyNun I also did upvote all your answers :))... I tend to upvote every answer posted to my challenges unless they're golfless.
Okay, who abused stars once more?
 
@Mr.Xcoder ya but it was yesterday
 
@LeakyNun Someone likes your style then :P
 
I made a new square root program but it was ~2 times as long ;_;
I had a twenty nine long one before...
:P nine would have been insane
 
8:58 AM
oh man, I can't even get that one anymore ;_;
oh wait I was running it in the wrong language >_>
 
9:17 AM
0
A: Sandbox for Proposed Challenges

Mr. XcoderGet a question's viewy ratio! We define a question's viewy ratio as the ratio between the number of answers of the certain question and the number of views, in short answer count/view count. Given an integer representing the id of a PPCG challenge, your task is to output its viewy ratio. For ex...

 
@WheatWizard In brainflak, how would you tell if a number is negative?
 
Anyone some feedback on this:
0
A: Sandbox for Proposed Challenges

Mr. XcoderFizz-Buzzify a String You will be given a String that only contains letters of the English Alphabet, both lowercase and uppercase (ASCII 65-90 and 97-122). Your task is to output the Fizz-Buzzified version of the String. How to Fizz-Buzzify a String? Each letter that has an even index in the ...

 
([({}<(())>)](<>)){({}())<>}{}{((<{}>))<>{}}{}<>{}
 
ok can you explain this (and how it works)?
 
maybe
 
9:22 AM
I don't know if it's interesting enough to post ^
 
I'll take a look I don;t remember off the top of my head
 
wait, I think there is a simple short way in sad-flak
that cannot work in brainflak
 
@DestructibleLemon Are you trying to create / Have you created a sad replicate of Brain-flak?
 
9:25 AM
squaring will be used probably
 
@Mr.Xcoder It might be interesting, but I don't personally find it very interesting.
 
;_;
this did not work how I intended
@WheatWizard why is it not interesting?
 
¯\_(ツ)_/¯
 
you have cut me real deep, wheat wizard
 
@DestructibleLemon I think we are talking about different things
 
9:31 AM
@WheatWizard Yeah, I didn't know what to say either
 
I'm not talking about sad-flak
 
9 mins ago, by Mr. Xcoder
I don't know if it's interesting enough to post ^
 
@DestructibleLemon If it Sad-Flak wouldn't be interesting, it would become Depressive-Flak
 
-1 starbait
 
9:33 AM
@DestructibleLemon I see it's on TIO already (and probably has been for a couple of days now)
 
actually not a couple I don't think
it is pretty recent
 
@DestructibleLemon Starbait? Nah, I have better things to do...
 
I keep feeling like there should be a simpler way to do this with multiplication and stuff
14 bytes longer than brainflak... I feel like I could get shorter by converting the brainflak
multiplication doesn't seem to be helping me beat brain-flak at tasks too much
 
9:51 AM
@DestructibleLemon what does it do?
 
it squares the number, then it square roots it, then checks if the root of the square is the same as the original
wait I just realised it could be golfed probably
wtf is there a bug in my interpreter again?
I have made a change that should be a golf but it isn't working properly
aha! I golfed it
who starred "what is a repcap?"
 
Jim
10:13 AM
Is this problem a known math problem?
https://codegolf.stackexchange.com/questions/128168/plant-trees-on-a-golf-course
 
also I have made it stack clean now I think
also I need to figure out how to do modulus good
also for the compiler chain the base will be a bf derivative with interactive output
 
Jim
@StewieGriffin As the author of this post, has your problem a name in the mathematical domain?
8
Q: Plant trees on a golf course!

Stewie GriffinThis challenge is inspired by this app. This is a much easier version of this challenge. This challenge is code-golf, while the other one is fastest-code. You'll be given a square input grid, of dimensions 6-by-6 which is divided into 6 areas, where the cells of each area have a unique iden...

 
-2
Q: Annoying bug getting data from PHP to Javascript

eveSomeone will shout me down for posting this nodoubt but Ive spent two weeks on trying to sort out a bug in a complex program, but Ive managed to boil it down to this example. <?php $te="hello"; //option 1 $te=time(); //option 2 ?> <script> alert(<?php echo $te; ?>); </script> With option2 ...

 
not again
give us a name change already, SE!
5
is there any other site that has to put up with this?
 
@DestructibleLemon ... Stack Overflow?
 
10:25 AM
no I mean people coming here and asking off topic questions because the name is bad
 
Probably a lot of them.
 
also there are very few other sites that didn't get a design after graduating
and Law has a decent name
 
@Jim I guess it does... But I have no idea what that word is... :
I'm not a mathematician, not even close...
 
10:43 AM
I'm gonna have to make a division thing too
 
10:56 AM
0
Q: Does it match the digit pattern?

caird coinheringaahingRecently I had a Maths test and, while waiting for everyone else to finish, I noticed that a certain number on the test matched an interesting pattern. The number (28384) matched a generic digit sequence that looks like this (n)(x)(n+1)(x)(n+2)(x)(n+3) etc... where n and x are single digit int...

 
ld : architecture i386:x64-32 of input file "obj/boot.o" is not compatible with output i386:x86-64
 
I'm posting this in chat for easy retrieval
 
ಠ_ಠ
 
(<>)(<>)(({})(<({{}})>))≤()≥
({}(()()()()()){}(<({}())>))(<>)
({}(<≤()≥>))(<>)({<>})
(({}[({})({}())]))≤[[]]()≥
{}({}{()})([])≤≥
this is not a working program
this is my work on the automorphic number challenge
 
@NewMainPosts bet somebody's gonna come up with a math formula for that
 
11:39 AM
uh oh my sign program doesn't work for 0
 
11:53 AM
I forgot how difficult esolang programming is
dangit
 
12:35 PM
1
Q: Does the OP have to explicitly state the winning criteria?

caird coinheringaahingIf a challenge is tagged with code-golf or fastest-code, do you really have to say that that is the winning criteria in the question? It seems pretty obvious, just by looking at the tags, right? After all, we don't say "this is a discussion" on questions tagged with discussion, do we? However (j...

 
Jim
12:56 PM
Pyth question: can't figure out how to efficiently test if all numbers in a list are equal
[1,2,3,4,5] => False
[1,1,1] => True
 
How to prevent gcc from adding the gcc 'watermark' in the generated binary?
 
1:08 PM
3
Q: Make it explode!

Stewie GriffinTake a matrix of positive integers as input, and make it explode! The way you explode a matrix is by simply adding zeros around every element, including the outside borders. Input/output formats are optional as always! Test cases: 1 ----- 0 0 0 0 1 0 0 0 0 -------------- 1 4 5 2 ----- 0 0 ...

 
00:00 - 14:0014:00 - 00:00

« first day (2339 days earlier)      last day (2505 days later) »