« first day (4268 days earlier)      last day (565 days later) » 
00:00 - 17:0017:00 - 00:00

12:07 AM
0
Q: Longest alternating subsequence

Bubblerinspired by Longest Increasing Substring Task Given a list of non-negative integers, output the length of its longest alternating subsequence. An alternating sequence is a sequence of numbers which alternates between strictly increasing and strictly decreasing. [], [999], [9, 1], and [0, 5, 0, 3,...

 
12:55 AM
@RadvylfPrograms whaaa
if worst case is best case, wouldnt it matter?
 
2321
Q: What does the ??!??! operator do in C?

Peter OlsonI saw a line of C that looked like this: !ErrorHasOccured() ??!??! HandleError(); It compiled correctly and seems to run ok. It seems like it's checking if an error has occurred, and if it has, it handles it. But I'm not really sure what it's actually doing or how it's doing it. It does look l...

 
you never saw that post?
this is like my 5th time seeing it
 
 
3 hours later…
3:59 AM
4
A: Sandbox for Proposed Challenges

PyGamer0Convert integer to IEEE 754 float The task is simple, given a 32 bit integer, convert it to its floating point value as defined by the IEEE 754 (32-bit) standard. IEEE 754 Here is a converter for your reference. Here is how the format looks: The standard is similar to scientific notation. The si...

feedback?
 
4:21 AM
@PyGamer0 first time actually reading it, im not sure what the red and green sections actually represent in terms of like... how do those values give the number on the right of the diagram?
 
i explained it below the diagram
 
then i request it be used as a worked out example :P
also "convert it to its floating point value" seems like not the correct wording, otherwise input should equal output, right?
or is it like
input -> binary string -> floating point
right ok so i guess in general i feel like, a worked out example would make it feel less daunting
it would verify what i think i understand and clarify what i dont, and sort of allow me to convince myself i understood what i needed to do :-)
 
ok i will add a worked out example later :-)
 
thank you ^_^
i guess my only other thing is "should it just be binary string input" but idk
not sure if it A) changes the challenge much B) makes it better or worse or not
 
no it will be given as an integer.....
 
4:29 AM
right no that is clear
its just a lingering question in my mind whether it should be that way
but i dont have an answer so it doesnt matter unless someone else says something too xd
 
4:43 AM
finally i got 1k reputation
 
5:14 AM
now you can have two 500 bounties out at once
 
 
1 hour later…
6:25 AM
CMC What does this regex match? []{}()[] (python)
 
1 day to slack day!
@mousetail I honestly don't understand regex :(
 
@mousetail Don't know Python regex, but in PCRE, my guess is the empty string.
 
@DialFrost Try it, the results will suprise you
@Adám Nope
 
No, wait, any character in ]{}()[
 
6:33 AM
i'm inclined to say it matches nothing but maybe [] is a corner case oh or yeah that
 
Exactly
A [] block can't be empty so it matches a literal ] character
 
If you want ] in a character class, it has to be first, which means the class continues until the final ]
 
 
5 hours later…
11:31 AM
@RadvylfPrograms What post would you like an upvote on?
Also, @lyxal, same question :P Didn't end up using any of yours, but they were so good, I have to reward the effort :P
 
@cairdcoinheringaahing this one
thank you :p
 
Don't take that upvote as my approval of Vyxal as a fizzbuzz specific lang :P
There's some questionable builtins there :P
5 bytes with extremely questionable builtins. also the 11-byter can be 10 with H flag — Steffan Jun 3 at 17:46
 
Vyxal has builtins for both fizz, buzz and fizzbuzz but uses only the last in the answer
 
Please explain
 
@cairdcoinheringaahing can't take this phrase seriously due to how an Australian politician said it once in an interview :p
 
11:42 AM
@lyxal It would be most kind of you to provide a comprehensive breakdown of the functionality of this implausibly short program
Or, "What do?"
 
in The Tarpit, Nov 13, 2020 at 20:27, by Lyxal
18 surprising bytes you need for FizzBuzz (number 5 will shock you senseless)
that shows the progression to 18 bytes
but for the 11 byter: ₁ƛ - map over range [1, 100], ₍₃₅ - the list [n % 3 == 0, n % 5 == 0] (the is parallel apply into a list - it takes the next two elements and applies them to the same stack), kF½ - the string "FizzBuzz" split into two halves , *∑ - multiply the string list by the divisible list and sum the result into a single string, and is dyadic maximum
 
11:59 AM
I was more asking about the 5 byter
 
5 byter?
oh yeah in the comments
that's for the lols
`ċ`ṪĖ
`ċ`     # Compressed string for "₁ƛ₍₃₅kF½*∑∴,"
   Ṫ     # Remove the last character
     Ė   # Eval as vyxal
purely a joke/easter egg
 
12:13 PM
hlleho
 
yellow there
 
I'll have you know that americans do not actually say that, except (usually) to be funny
(it's not actually that funny anymore)
 
well jokes on you I'm Australian so it can be funny here
 
Is this mathcats alt?
 
except yall actually do go "good eye might" to greet people
@mousetail No, mathcat is my alt d:
 
@Ginger Wait rly?
 
@mousetail hmm
I wonder
@emanresuA thanks (btw I'm a sock lol) — mathcat Jan 30 at 18:27
 
A sock for ginger?
 
@DialFrost no, I was joking, that's why I included a d:
 
12:18 PM
@Ginger sigh no, you weren't JoKing. You were (and still are) Ginger.
get it right
 
nope! I actually am a sock of @JoKing
 
I'm actually a sock of Sandbox
 
and you can't prove I'm not
@mousetail I'm a sock of myself
 
@Ginger not yet
 
ಠ_ಠ
when you say things like that I become concerned
 
12:20 PM
the strikethrough should indicate that it's /j
 
I never know with you
 
13 hours ago, by lyxal
@RadvylfPrograms alternatively, train everyone to expect an implicit /j in contexts where it's obvious you aren't being srs :p
 
isn't "implicit /j" a programming language
2
 
:p also works
Is there a challenge yet to print all subsequences of the natural numbers?
 
12:38 PM
@mousetail i believe so? is this what you mean, or do you mean specifically subsequences and not substrings?
 
I mean subsequences, like (1), (2), (1,2), (3), (1,3), (2,3), (1,2,3) etc. going up to infinity
 
ah i see
 
I'm kinda concerned by the fact that roughly every fourth new question is spam/inappropriate for this site
 
That's mostly due to the very low volume of graduating sandbox questions
 
but we appear to be getting them at a rate of approximately one every one or two days
even excluding sandbox questions that feels kinda high
also, I think the absence of sandbox questions is in part because of the fact that NSP is offline and we have to use feeds, which is very slow and seems to not be all that reliable
 
12:44 PM
Could be
Good thing we have ginger bot
 
lol
 
Yea I have several sandbox questons that have been sitting at 0 for weeks
really kills my motivation when I don't even know what's wrong with them
 
GB is still in the testing stages of replacing NP/NSP, and runs on a library that I made and therefore has the reliability of a 1940s cruise missile (to paraphrase radvylf)
 
Quick off-topic qns, anyone here interested in viewing an astronomy question and answer? I need some tips :3
 
Also off topic: ever wanted to see what a IRL TNB meet up would look like?
user image
4
Generated from the usernames Ginger, pxeger, thejonymyster, mousetail, lyxal, caird, seggan, dialfrost and bubbler
 
12:54 PM
Lmaooo I don't see "dialfrost" as an object anywhere
 
bottom row, middle
that's alledegly a "dialfrost"
 
@lyxal wait who is who lol
 
All I see is "TONY"
 
Interesting that is generates hard edges sometimes
 
@lyxal the clock?
 
12:56 PM
top row left = ginger
top row middle = pxeger
top row right = thejonymyster
middle row left = mousetail
middle row middle = me
middle row right = caird
bottom row left = seggan
bottom row middle = dialfrost
bottom row right = bubbler
@mousetail that's an unfortunate side-effect of how it was generated.
it was done one 1024x1024 box at a time
 
Am i the clock? I dont understand what I am XD
 
I do feel like it captures TNB perfectly
 
@DialFrost apparently so
 
hey don't we have a off-topic room? :b
 
Well it’s a dial
 
12:56 PM
@Fatalize Hehe, but where's the frost??
 
also: GingerBot is now ready(?) to replace NP/NSP
 
@Ginger we do, but a TNB meetup is very on topic :p
 
@Ginger Erm, everyone's too lazy to switch
 
ah, right
GB will be running in the sandbox for now while I make a bunch of repairs to sechat so it'll work better
 
I feel thejoynmyster is the best one. It hints at something more
 
12:58 PM
so for anyone who wants to see new posts and sandbox posts go to chat.stackexchange.com/rooms/1/sandbox
 
@Ginger Ginger your literally a ginger XD
 
you don't say
 
Anyone keen on seeing a simple astronomy answer? I need some tips
 
Bubbler and ginger are the only ones that actually look like their names
 
i dont wanna send the link without someone's consent else it's "advertising"
@mousetail Agreed
But if my clock had ice and snow on it then I'd fit!!! :P
 
1:02 PM
@lyxal i figured that part was me somehow lol
 
1:16 PM
Hey guys I sent a link in the off topic TNB, if you think the answer needs improvements please let me know :3 Cuz I really like the qns and want the best possible answer for the OP
 
Posting the link in OTTNB and then talking about it here doesn't reduce clutter, it just disperses it :p
 
huh
k nvm
Isnt dispering better?
:D
Half here half there!
 
I guess so lol
 
Well cya I have to cram for my last "hard" paper!
 
1:19 PM
@RadvylfPrograms biology :(
 
You are alive right? Quite a tricky thing, you must be a expert. IMHO living things should pass by default.
 
taking a biology class
dies
aaaand you failed!
 
@mousetail lmao
 
@mousetail cant you see, my pfp is a Seggan?
 
@Seggan Hai seggan
 
1:24 PM
I have no idea what seggan is
 
oof i said that out of context
 
the last time I saw you, you had 300 rep
Now you have 11k ...
Grinding I see?
 
The DALL-E image is the context right?
 
@RadvylfPrograms Wish me luck! After this I'm back to full-time golfing (ok I have an additional 2 papers left, but you can't study a lot for those so um ya :D)
 
Nice!
Good luck!
 
1:29 PM
Although Im completely out of my league now for golfing :( I can hardly solve any question in python without golfing even
 
Just takes practice. I'd feel the same way, I haven't golfed in ages
 
But your smarter! You learn faster! :3
I think? not sure
 
we write short code, not fast code. take all the time you need :-)
5
except for when we do write fast code
 
CMC Become a god-tier code golfer in the shortest time
 
@thejonymyster hehe, but I'm not that good at problem solving, which is my main disadvantage
 
1:35 PM
@DialFrost dw were in the same boat i only answer easy challenges
 
2:27 PM
CMC output n evenly separated numbers between x and y, inclusive of the ends
in R, seq(x, y, length.out=n)
 
nope
 
try x=1, y=10, n=5 as a test
should be 1.00 3.25 5.50 7.75 10.00
a python answer would be great!
(no numpy allowed :))
 
Um guys
how do I import modules using pip in attempt this online?
 
Probably not possible
 
Don't think you can, I'd assume there's no internet connection
 
2:33 PM
^
 
There are some common modules built in though
 
aww ok
 
@DialFrost google colab will let you
 
or replit
 
i'm planning on having a whitelisted list of domains on RTO for Plus users, which will allow installing pip/NPM packages
And any other common package managers
 
2:34 PM
Plus users?
 
Yeah, anyone with a CGCC or GH account linked
 
In [17]: def seq(x, y, n):
    ...:     val = x
    ...:     print(val)
    ...:     for _ in range(n-1):
    ...:         val += (y-x)/(n-1)
    ...:         print(val)
    ...:
basically this but golfed
@mathcat ^^^
 
Python: [x,y+1,(y+1-x)/n][:n]
I think this is valid
 
@RadvylfPrograms users++
 
Maybe I could make a browser extension which would allow RTO to send all of the web data to the client, which the extension would intercept, and act as a proxy
Although that'd be complicated and probably not super useful
 
2:36 PM
@mousetail set x =1, y=10, n=5. I don't think it is right
 
Yea that feels overengineered
 
[1,10+1,(10+1-1)/5][:5]
Out[20]: [1, 11, 2.0]
and also wrong :)
 
hEy YoU wAnNA GEt RtO GoLD jUSt iNStALl oUR hAnDY dAndY ExTEnsIOn nO viRUs hERe
 
@graffe Replace all commas with :
[x:y*2:(y+1-x)//n][:n]
 
or [(y-x)/(n-1)*i+x for i in range(n)]
 
2:39 PM
@mousetail the output should be [1, 3.25, 5.5, 7.75, 10.0]
 
Oh I thought integers
 
@mathcat that works!
you win :)
 
@RadvylfPrograms u planning to have registration?
 
As in users signing up? Yes, you'll be able to make an account through SE or GitHub
 
yay
 
2:41 PM
That'll give you access to more resources (e.g., more RAM and a longer timeout), as well as things like the fastest-code and king-of-the-hill environments I'm planning
 
hmm is it paid?
 
@RadvylfPrograms Would be nice if you could save multiple unfinished solutions
 
@Seggan No ofc not
 
Plus sounds like a paid plan
 
Yeah I know. I call it "RTO pro" or "RTO plus" to make it sound more premium than it is :p
@mousetail Interesting, that could be a good idea, and since I'll already need to store stuff on the server anyway for permalinks I could do that
 
2:48 PM
translating R to Python is hard... when you don't know any R
 
… for any language R.
 
Eh, not necessarily. Translating something vaguely Python-like to Python isn't as hard
 
@RadvylfPrograms what are you thinking of?
R to numpy would be easier I feel
oh I see.. you mean R is a bit like Python?
I don't even know enough R to agree or disagree with that :)
only just learned about $
 
challenge idea: zottffssent.. but up to n
 
@graffe Oh, no, I mean the opposite. I was replying to Adám
 
2:54 PM
@RadvylfPrograms can hardly wait for more people to use OLIMAR :p
 
@RadvylfPrograms ah ok
sorry
@Adám yes!
 
3:14 PM
LDQ: do and make sense as "prefixes" and "suffixes" respectively?
i can explain my reasoning, but i just wanna gauge if anyone would be confused right off the bat / intuitively understand
 
eh?
 
@thejonymyster switch them around
 
thats what i figured id hear :P my reasoning is that the horizontal line is the string/list, and the vertical lines are terminal points. in prefixes, there are multiple endpoints, in suffixes there are multiple start points
but i can see how thats a bit of a leap from the strong intuition of the ╙╜ shape :-)
but like to illustrate:
hello

|hello
------
h|ello
 -----
he|llo
  ----
 
3:34 PM
hey I came up with a new language idea
here's an answer to codegolf.stackexchange.com/questions/62500/cat-goes-meow in it: i"cat"{rP.}{r" goes meow"sPP.}=?
 
whats it abt
 
the idea is that there is no result chaining or parameters or anything like that, the only way functions can take input or return data is by pushing and popping from a stack
 
isnt that just how stack based languages work?
 
it is lol
so I guess it's just another stack-based language
 
also I don't think I've given up quro
 
3:42 PM
time to come up with a new idea I guess
 
@mathcat the USP would be, that it's a fractional byte stacklang (I guess?) but I've thought about some extra features
 
USP??? what mean does that
 
no wait not usp
yes usp
"unique selling point"
 
ah yes
maybe I could make a language with a complex number byte count
or one that uses qubits? actually that could be cool
 
@Ginger Explain
 
3:49 PM
@Ginger that would require any of us to understand qubits :P do you?
 
Q# (pronounced as Q sharp) is a domain-specific programming language used for expressing quantum algorithms. It was initially released to the public by Microsoft as part of the Quantum Development Kit. == History == Historically, Microsoft Research had two teams interested in quantum computing, the QuArC team based in Redmond, directed by Krysta Svore, that explored the construction of quantum circuitry, and Station Q initially located in Santa Barbara and directed by Michael Freedman, that explored topological quantum computing.During a Microsoft Ignite Keynote on September 26, 2017, Microsoft...
Fun fact, Q# is on TIO: tio.run/#qs-core
 
@cairdcoinheringaahing I'd just treat it as a fractional-byte language except each bit can be in 3 states instead of 2 (0, 1, and both/indeterminable)
with 3 bits per instruction that gets me 27 instructions
 
That's just ternary
 
That's just Malbolge :P
 
Those aren't bits they're trits
 
3:51 PM
whoops
time to do more research :b
 
I don't believe you can even get "complex" byte counts, given that complex numbers aren't exactly "real" :P
 
And ternary computers with that exact same 0,1,nondeterminable thing have existed since soviet times :p
 
(no one make the joke)
 
@cairdcoinheringaahing In theory since the byte count is log(possibilities) / 8, if you had a negative number of possible programs in your language, you could :p
 
What can you language do? The better question, is what can't it do :P
 
3:52 PM
So just write Jelly but with a really negative outlook on life
@cairdcoinheringaahing Oh that's a better idea
 
@RadvylfPrograms I assume log_2 and not log_e? :P
 
@cairdcoinheringaahing That's just MetaGolfScript
 
can we have a fully analog esolang, with continuous programs (rather than having discrete bits)
 
ooooooh
that's actually not a bad idea
 
Sounds similar to FRACTRAN
 
3:54 PM
@thejonymyster If you take the limit of the program as the number of instruction step functions tend to infinity, it becomes continuous :P
 
i wonder if you could have a physical machine to compute conedy over the reals :P
(rather than just the rationals)
ah wait, thatd be analog but the program would still be discrete. doh
 
I mean, the reals are just limits of sequences of rational numbers
 
4:16 PM
CMQ: Should my golfing language's integer type support signed zero and the infinities?
If not, what should converting infinity to an integer do?
 
You could say the int max value represents "infinity"
 
They're bigints
 
Ok then I see no harm including infinity
 
4:28 PM
how do bigints work?
 
well they're big ints
 
how big
 
bigints have arbitrary length
 
what do they do that regular ints dont do :-P
like, in implementation
how can they be arbitrarily large / how come regularly they cant be without being "bigints"
 
4:34 PM
@thejonymyster They'd just be a vector of smaller ints, basically digits in base-256
 
thank you all i am learning :-)
 
question: if I make a language with fractional bits, which obviously cannot be represented accurately with normal characters, can I claim a score on a post in said language that differs from the bytecount of the visual representation of the program?
 
@thejonymyster but the real question is how does arbitrary precision floating point numbers work?
 
@PyGamer0 At least for my golfing language, they're going to be iterators of rationals
 
4:38 PM
@Ginger have you considered the case of Fig?
 
fig has fractional bits? I thought it had fractional bytes
it does have fractional bytes
I'm confused
 
byte = 8 bits
fig has "fractions" of bytes that are not 1,2,3,4,5,6,or7 bits
ergo fractional bits (?)
(just trying to follow along :P)
 
@Ginger both
 
@thejonymyster ??? "fractions of bytes" == "fractional bytes" not "fractional bits"
 
my calculator says it has 0.10289ths of a bit
wait that makes no sense
anyway, the score is not a multiple of 1/8
so therefore it must have a fractional bit
 
4:43 PM
@Ginger a byte is made of bits...
 
i love how the XOR lookup table is perfectly square
 
:|
 
my idea is for a language where each bit, not each byte, is split into two half bits (which can be 1 or 0 as well) and can therefore technically be in four distinct states, or alternately two sets of two states
 
hmm is that even possible
 
4:45 PM
@Ginger that sounds like having two bits :-)
 
reality can be whatever I want
@thejonymyster well yes but it's actually one bit
 
iirc we require all scoring systems to be at least theoretically buildable
 
hmmmmmmmmmmmmmm
this concept is screwing with my brain and also may not technically be possible
the way you would represent this language would probably be as a sequence of half-bits, so for example the program 0110100 is actually 3.5 bits long despite technically being 7 characters
 
@Ginger That's not how that works
A bit is the smallest meaningufl amount of information
 
darn
coming up with a competitive and original golfing language is turning out to be extremely hard because everything's been done already
makina is not by any stretch of the imagination a golflang, APOL sucks and I'd rather forget it exists, and KonamiCode is just reskinned brainfuck
 
4:57 PM
@Ginger No, everything you've thought of so far has been done already.
Keep thinking of things and eventually you will travel farther from (0, 0) in some direction that you'll load new chunks
 
but we are beginning to approach the metaphorical world border
 
I don't think so
 
you cannot get any smaller than fractional-byte languages
you said so yourself
 
On the contrary, the smaller the size of each individual operator, the less efficient the language is
 
00:00 - 17:0017:00 - 00:00

« first day (4268 days earlier)      last day (565 days later) »