« first day (4267 days earlier)      last day (569 days later) » 
00:00 - 13:0013:00 - 00:00

1:00 PM
@lyxal send them to OTTNB!
 
2 messages moved to Off-Topic TNB because Ginger asked me to lol
 
@Ginger I always start laughing when I get to the and their developers are ATTRACTIVE part of the title text
 
@Ginger this is the future
 
and I'm going to report them to the FCC for their IMPECCABLE VIRTUE
 
I'm already really creeped out by the AI filters most phones have on their cameras nowadays
 
1:03 PM
CMC: Output any 40 different prime numbers
 
@Neil And presumably no non-prime numbers?
 
@Neil Vyxal, 40vǎ
for each number in the range [1, 40], get the nth prime
 
@RadvylfPrograms indeed
if that's too easy, try it again without using any prime builtins of any kind
 
ooooh man i saw this in HNQ and thought "why is that on SO????"
6
Q: How does `Solo` prevent space leaks?

ClintonI ran into the documentation on Solo, the one element tuple, and was a bit confused about how it says it can prevent space leaks, which makes me suspect I'm not understanding something about how the Haskell memory model and/or garbage collector works. To quote the docs, they say: The most import...

 
they were asking about how solo cups keep liquids from splashing everywhere ofc
 
1:08 PM
@Neil Vyxal, 6 bytes: ⁺L'KḢ₃
From all numbers in the range [1, 179], keep those where the divisor count is 2
 
@lyxal this is amazing :P
 
@cairdcoinheringaahing there's more in off topic tnb
 
Goddamn, now I have to brave the wilds of OTTNB to see cute dog photos :P
 
still to easy? try again without even using division
 
just found this :P
 
1:12 PM
@cairdcoinheringaahing fear not, we will guide you
just don't look anything you see there directly in the eye
 
AICMC: Sort a list of numbers by their decimal expansion, ordering by most significant digit then second most significant digit, etc. (e.g. 10 -> 0.001, 1 -> 0.0001, 11 -> 0.0011, 0.001 -> 0.0000001, 0.0001 -> 0.00000001, 0.0011 -> 0.00000011, ...)
 
I seem to remember I tried #44 as a main post but it got closed
 
dont ask me about the test cases
AICMC: Given a list of integers l, output a list of triplets (a, b, c) such that the sum of a, b, and c is equal to 0. For example, the input [1, 2, -3] should yield the output [(1, -3, 2), (2, -3, 1)]
 
@Seggan Honestly, Sub[47] would be a fun meta sequence for them to include :P
 
@Neil Vyxal, 12 bytes: ⁺M'ɾ2↔vΠ=∑2=
 
1:15 PM
@cairdcoinheringaahing LOL
 
Sub 44 could actually be interesting
 
lets petition them
 
ignoring kerning it would be computable pretty easiliy
 
@lyxal From all numbers in the range [1, 179], keep those where the sum of whether products of combinations without replacement from the range [1, n] = n equals 2
 
@mousetail I'm not sure "interesting" is how I'd describe that :P
 
1:15 PM
^
 
Like for a challenge
 
@Seggan it has a nice habit of doing weird stuff
 
gpt3 is actually a great challenge idea generator
 
@lyxal hmm, and how long would it be to generate k*k − k + 41 for k from 1 to 40?
 
1:16 PM
yes
you never said efficiently, just to print them :p
 
CMC: Find the first element of sub[43] as of today
 
I think we've already done this :P
 
Yeah it sounds familiar to me
 
@RadvylfPrograms 1319283185284635182?
its definetly in Sub[43]
 
@Seggan I doubt there are that many OEIS sequence example numbers :p
 
1:19 PM
argh i suck at spelling definetly
 
Everyone does, it's definititle the hardest word to spell
 
@Seggan 812045 is smaller, and in Sub[43]
 
@RadvylfPrograms I definittiniteltitlettitly agree
 
It's defiantly hard to spell
 
@lyxal had you wanted to be inefficient you would have just printed a long string :P
 
1:21 PM
that's efficient though - that runs in constant time
not golfy though
 
> Numbers n such that Bernoulli number B_n has denominator 2730.
OEIS is so weird
 
^
 
> Numbers with no "e" in Dutch.
> Heard over coffee at the Computers in Scientific Discovery meeting in Ghent, Feb 02 2006
 
vijf
acht
 
1:26 PM
Wow that suddendly grows really fast
 
> Integers often used as card values in Planning Poker decks.
 
> A thinks of x in set M; B asks questions: is x in T?; A may lie once but only when true answer is Yes; a(n) is maximal size of M such that B can determine x with <= n questions.
 
> Non-integer values may include "1/2", "?", "infinity" and "coffee cup".
4
thank you OEIS very cool
 
I am a non-integer value myself
 
me and the homies extending ourselves into the complex plane
 
1:28 PM
Oh wait that's planning poker, the coffee cup is the most important card there
That's like saying non-integer playing cards include kings, jacks, queens and aces
 
Expired certificate
 
 
ik
 
And homepage is 404
 
1:29 PM
@RadvylfPrograms Time to DDOS OEIS :P
 
0/10 would not recomend
 
@Ginger oh boy there's johnvertisements
you know you're in for a weird site when you see those
 
what
 
@Ginger Glad you enjoyed
 
1:32 PM
gah, they noticed
 
@awagga with the johnvertisements, I'm surprised you aren't a part of GEORGE
 
I am anti-george
 
gasp
 
George is a miserable creature.
 
unacceptable. prepare to be GEORGEd
lyxal, activate the GEORGE RAY
 
1:33 PM
@awagga nonsense. The GEORGE is a noble creature
 
@lyxal What is this?
 
@Ginger incorrect
 
@mousetail johnvertisements
 
I appreciate these rules:

you should be able to legally show the advertisement to a child
you should be able to morally show the advertisement to a child
 
@mousetail john.
 
1:34 PM
Weird, I do not pay for that domain anymore
 
locke.computer
 
@mousetail basically, the tip of a really big esolang/apioform iceberg
 
did you know? i use johnvertisements as a makeshift site visits counter
 
did you know? the old vyxal interpreter domain has johnvertisements
once had at least
they were removed for some reason
 
did you know? h
 
1:36 PM
I'm very confused but enjoying it
 
it's a relic of Web 1.0
 
@mousetail approach the above with caution
for it is the source of john
 
crazily enough, these sites are still being updated and maintained
 
Maybe take this to OTTNB y'all
 
1:42 PM
^
 
I think the conversation on that is pretty much done anyway
 
yes
 
For some reason TNB chats are mostly off-topic these days
 
"these days"? trust me it used to be a lot worse
 
Oh yeah. You were first active in TNB right at the time we were strictest about being on topic, but that was definitittytlky an unusual time period
 
1:49 PM
what, now or then?
 
ig@RadvylfPrograms was talking about now
 
Currently is about as strict about off-topic as TNB's ever been
 
it helps that we now have a dedicated off-topic chatroom
 
Tho, I mean "currently" to refer to the past 6 months or so
 
has anyone ever posted a message containing topics that TNB had discussed?
oh wait i hv (a partial one)
 
1:51 PM
Should OTTNB be linked to in the room description now that it's an "official" CGCC room like TNB now?
5
 
I disagree that it is "official"
 
Yes
I have trouble finding it a lot
 
I agree
 
I think yes
 
Sep 3 at 13:45, by Radvylf Programs
How official is OTTNB going to be going forward? It was originally just an experiment, so there was never any real announcement or fanfare, and now it's pretty consistently got activity and around 4-5 users online. It's currently got the same ROs as normal TNB, and it has TNB in the name, so should we in some way formally make it an official room?
 
1:52 PM
we could do ye olde star vote system :p
or a meta post lol
I'm gonna go write one up, brb
 
Okay so I think we agreed we'd give it a name, do a Meta poll, and give it a chatiquette before making it official
 
I'm just gonna flex my "being old"-ness here, but OTTNB isn't the first off topic room TNB has had
 
really?
 
@cairdcoinheringaahing That doesn't surprise me
We had enough off-topic for five rooms, loooking at transcripts from back then :p
 
There's been multiple, all of them freeze after a while, then a new one is started. OTTNB is far too young to be "official"
 
1:53 PM
whoa
i really have missed a lot here
 
you have lol
and I've only been here for about 10 months, caird and co have been here for years
 
If OTTNB is still around and active after a year, I'd be more okay with editing it into the chat room description
@Ginger I've been here for 5.5 years, and that's only about 1/3rd of the site history
 
I need to update my website to be a joke site again now that I'm no longer actively job hunting
 
yesterday, by Wheat Wizard
I really don't think 2 weeks is to short, most meta posts reach consensus far faster than that. But I always feel like CGCC users suggest ridiculously long time frames for waiting for things. Ultimately it doesn't matter at all because none of this is really time pressing at all and if we want to way a month or a year or whatever it certainly doesn't matter to me.
> But I always feel like CGCC users suggest ridiculously long time frames for waiting for things.
a year feels way too long! I'll be old then! :p
 
It's been around for just under 5 months now. Granted, that's longer than a lot of chat rooms, but not that long
Besides, we already direct people there when necessary, you can find it on the site chat room page easily, given it's activity, and you can just star it if you need to get to it
 
1:58 PM
If it's official it will probably survive
 
I do not have that opinion, and we all know what happens when there are differing opinions that need to be resolved don't we
 
It's annoying when a discussion is "moved to OTTNB" but I have to search through the terrible chat list interface to find the room to continue the discussion
 
Feel free to post to meta, I'm 83 upvotes and 35 answers away from a gold badge :P
 
@cairdcoinheringaahing Correction: that's almost half
The site's been around for ~11 years, 8 months
 
2:00 PM
@Ginger wait i thought u were older than me
 
0
Q: Should we officially recognize Off-Topic TNB?

GingerRecently, TNB conducted an experiment in which we created a new room specifically for off-topic discussion, which resulted in a marked decrease in the amount of off-topic content in TNB. This room has now been around and active for over five months. Should we "officially recognize" it and add it ...

 
@mousetail i have a joke website too
 
@Seggan nope, in almost every way you have been here for longer than I have
 
not malicious
 
This is my joke website: rebuildcivilization.com but I'm thinking of making it my primary
 
2:01 PM
i havent released mine yet
its a webpage
 
loving the typos lol
 
me?
 
yes
in your site
 
I'd nevr make tpos, your confsing mee with someoen else
Anyway, any takers to join my duck cult?
 
fo curoues
 
2:04 PM
> I'd nevr make tpos, your confsing mee with someoe else
i'll pass
 
it's
a joke
do you get it
 
Speaking of things like managing off topic - after the mod election, are we going to need another RO election to replace the RO that becomes mod? Because iirc mods don't RO normal rooms
 
nah
@Ginger i'm called a dry person at school
when it comes to humor
 
maybe you should ask lyxal to moisten you then
 
Whoever new player joins the site first after the election becomes RO
 
2:05 PM
@Ginger yeah right
 
jousting is done irl, not online
 
bruh
you don't have enough humor to participate here. we will now be banishing you. /s
 
so how can the tournament even be done?
 
you're just messing with me now
 
2:09 PM
@py3programmer Jousting with very very long poles
 
unless you want to trigger some small-minded nosy neighbour
 
If a neighbor complains joust them too
 
@lyxal They don't?
 
eternity while i procastinate on this
 
let's find out!
 
2:11 PM
@lyxal No
We're both active here, I doubt that becoming a mod will cause either one of us to stop doing any ROing. In fact, it'll probably do the opposite, given we'd have increased moderation powers in chat
 
@mousetail i do that, im dead
 
@RadvylfPrograms Should the Bakery?
 
why are most of @Ginger's messages removed
 
The Bakery is more "official" than OTTNB :P
 
@py3programmer Then your neighbor becomes the new RO
 
2:13 PM
@py3programmer because they weren't funny or constructive, so I deleted them
 
I'll be nepotist and you guys will change to another RO
 
the way I do it is:
- think of thing
- lizard brain goes "ha! funny/constructive!" and posts
- at the same time rest of brain is doing a more complete funny/constructive evaluation which takes about 5 more seconds
- if rest of brain disagrees then I delete message
 
@Ginger Please don't delete messages unless they really need to be. It can be disruptive to the conversation if messages that are part of it get deleted
 
^ and this is why I'm working on doing step 3 FIRST
 
interesting
 
2:14 PM
but sadly my brain makes that very hard to do
however that is a different discussion for a different time
 
mine goes like: i think of something, post it, get reprimanded by mods, and delete it
 
Me: supposed to be studying for exams
Also me: *playing 2048*
 
on poki?
 
2
Q: Should we officially recognize Off-Topic TNB?

GingerRecently, TNB conducted an experiment in which we created a new room specifically for off-topic discussion, which resulted in a marked decrease in the amount of off-topic content in TNB. This room has now been around and active for over five months. Should we "officially recognize" it and add it ...

 
took ya long enough
 
2:19 PM
ya true
 
no, I ginger
 
exactly, you took long was wut i said
 
2:42 PM
0
Q: Incomparable partitions

Wheat WizardA partition of a list \$A\$ is a way of splitting \$A\$ up into smaller parts, concretely it is list of lists that when concatenated gives back \$A\$. For example [[1],[2,3],[5,6]] is a partition of [1,2,3,5,6]. The trivial partition is a partition that "splits" the list into only one piece, so [...

 
@UnrelatedString people using clang instead of gcc be like
 
@Ginger TCC gang
 
Turing Complete Compiler?
(two) Tons of Creamed Corn?
Tux Can't Cook?
 
Tiny C Compiler
 
hey didn't someone make a c compiler in lisp??? or am I thinking of something else
 
2:46 PM
I imagine there is a partially functional C compiler in most any language, depends how stable and feature complete you consider to be "real"
 
@cairdcoinheringaahing No, because the Bakery is only really relevant to 8 of us
 
To Completely Compile?
@Ginger speaking of turing completeness what are you guys doing in cgol?
these days
im trying to make a pattern that swallows up still lifes
and leaves more still lifes behind
for the most part, I've succeeded
 
3:04 PM
@Ginger oh wow
 
3:33 PM
Can someone else upvote this answer? I need that account to be able to use chat
 
No
Sad you got it anyways
 
pardon?
I don't normally ask for upvotes, but I make special exceptions for getting bot accounts at least 20 rep because they won't use that rep to do anything but chat and will not do anything else on the site.
 
Where is this sandbox chat? I want to make fun of your bugs /s
 
Why are you being so openly hostile to Ginger?
 
3:46 PM
I'm just messing with you, no ill intent
 
Well, generally we include something to signify that
 
You should probably make that more clear with :ps or /s or something then
 
^
 
no hard feelings but please be more careful next time, we're all(?) human here
 
3:48 PM
I'm a mouse, I sometimes don't understand humans. Sorry about that
 
see this is what happens when I make generalized statements about TNB users
 
Stick to making generalised statements about the bytes
like there are 19 of them and they are all less than 256
 
wait how do we know that one of the ROs hasn't put a zero-width space after the e, thereby making the title ACTUALLY 21 BYTES LONG
 
:o
#vote-of-no-confidence
 
@Ginger *21 since NBSP (codepoint U+00a0) is two bytes in UTF-8 :p
 
3:51 PM
so the title doesn't use a SBCS? huh
 
NBSP can replace a space
 
That or we switched TNB to an SBCS before y'all noticed
wow ninja'd
 
I think you might be confused with 0-width spaces
which are invisible
 
gone before you see me coming
@mousetail right lol
 
ZWSPs are three bytes though!
 
3:52 PM
DAMMIT
 
said that just at the 2m30s mark
 
f
Can we replace one of the letters with a similar looking one maybe?
 
russian е, im all for it
 
I know there's a good homoglyph for T too
 
3:55 PM
 
wait you got that wrong too
you FOOL
 
maybe the NBSPs are in a column instead of a row
 
AAAAg I just saw
@RadvylfPrograms that would make sense
 
And since they're non-breakable, they really are separated
 
There, fixed it
user image
7
 
4:25 PM
2
Q: Find a word in the dictionary of all possible words

Aiden4Given an alphabet represented as a nonempty set of positive integers, and a word made up of symbols from that alphabet, find that word's position in the lexicographically ordered set of all words, assuming words can't contain duplicate symbols. Example Consider the alphabet {1, 2, 3} and the word...

 
4:46 PM
got my yearling finally :P i was like, its gotta be soon lol
 
nice
 
now to go inactive for a year (hibernating)
 
5:32 PM
CMC: given a string of {|},, determine if the input is a surreal number
(alternatively, you may take the input as a ragged list whose top level has length 2)
(you can assume all the brackets will be properly matched with | between them and commas placed where they need to be, etc. this isnt a "match the brackets" challenge, is my point)
 
5:54 PM
hm its possible that this is incredibly hard :-)
 
who read that before ^ :P
 
 
1 hour later…
7:20 PM
~a == -1 - a, right?
 
7:34 PM
@Seggan Which language?
 
7:47 PM
@Seggan Yes
@Adám Presumably any languages with C-style bitwise operators
 
Could be, but could also be that ~ means "is falsey".
 
what radvylf said
i meant ~ to be bitwise not
 
@Ginger This works pretty well with a slight modification: add a 5-second pause before hitting the Enter key. The one drawback is that sometimes an otherwise funny joke doesn't work because the conversation has moved on already, but that doesn't happen to me too often.
 
reason im asking is that im trying to implement bitwise ops in a language that has none :P
shifts and not were relatively easy
 
@DLosc that's the problem :p
 
7:51 PM
shift is just a << b == a * 2^b
 
Yean AND/OR is gonna be annoying
 
^
 
for and, or, and xor, i had to do a lookup table
local function bitwiseOp(a, b, lookup)
    local intA = math.floor(a)
    local intB = math.floor(b)
    local result = 0
    local nibble = 1
    while (intA > 0 or intB > 0) do
        local aMod = intA % 16
        local bMod = intB % 16
        intA = math.floor(intA / 16)
        intB = math.floor(intB / 16)
        result = result + lookup[aMod + 1][bMod + 1] * nibble
        nibble = nibble * 16
    end
    return result
end
 
Interesting
 
basically apply a lookup table on every nibble
 
7:52 PM
Guess that's probably more efficient than what I'd do, which is shift a bunch and work it out a bit at a time
 
the function is the same for all 3, just different lookups
i literally just have
function bitwiseAnd(a, b)
    return bitwiseOp(a, b, BIT_AND_LOOKUP)
end

function bitwiseOr(a, b)
    return bitwiseOp(a, b, BIT_OR_LOOKUP)
end

function bitwiseXor(a, b)
    return bitwiseOp(a, b, BIT_XOR_LOOKUP)
end
@RadvylfPrograms yeah i was wracking my brains for 30 mins trying to figure out how id do it with minimal performance penalty :P
it does compute xor of 100000 and 999999 very fast tho
so fast its not noticable
 
for AND id read as base 3, add, and then regex the 1s to 0s, then the 2s to 1s :P
 
ehh too slow
interesting tho
 
:P lol i have no intuition for fast or slow algos
 
executing bitwiseXor(100000000, 999999999) one million times takes .097 seconds
for i = 1, 1000000 do
    bitwiseXor(i, 1000000-i)
end
this takes .096
so its very fast
 
8:06 PM
wow
i need to take a class on algorithms
fast code is cool
 
its pretty much universally known regex compilation is slow?
 
shucks buster guess i just dropped out of the universe :-)
 
Yeah, I was gonna say: depends on what your universe of discourse is. Most people don't even know what regex is. :P
 
is it something to do with the complexity of regex or is the task of "replace all of this single character with a different single character" inherently slow?
 
the 1st option
also ure doing 2 base conversions
and a base 3 addition (using strings)
 
8:18 PM
i was expecting the slowness to come from the conversions yea lol
num -> string -> num (from base 3) -> add -> string -> replace -> replace -> num (from base 2)
can probably swap the two replaces for a regular like, for loop through the string :P
 
still o(n) for replaces
mine would be o(n/4)
(kinda considered o(n))
 
8:53 PM
s/kinda/definitely/; s/o/O/
:P
 
my rol parser can now parse a good bit
var a = input()
a *= 2
print("input squared is " + a)
->
Statements(VarDef(a, constant=false, type=null), VarAssign(a, FunctionCall(input, )), VarAssign(a, BinaryExpression(VariableAccess(a) * 2.0)), FunctionCall(print, BinaryExpression("input squared is " + VariableAccess(a))))
 
1
Q: Fastest Gematria calculator

The ShwarmaGematria is an ancient Jewish method to determine a numeric value of a letter sequence, using a fixed value for each letter. Gematria is originally applied to Hebrew letters, but for the context of this challenge, we'll use Latin script instead. There are many ways to implement Gematria in Latin ...

 
9:23 PM
@DLosc (definitely cOnsidered o(n))
 
9:44 PM
@JoKing lOl whoops
 
JOKing
so i get that O notation ignores constants but like
dont they matter practically
and is there a notation which reflects this :-)
 
@thejonymyster Yes but that's not what O notation is for
@thejonymyster I mean, it's sort of a slippery slope
 
sure i can see that
 
You could do what the Art of Code guy did and design your own computer which you use to see how long algorithms take
Not Dennis prager but his name was similar
 
sure ill do that right now
 
10:16 PM
Yeah, big-O notation is a theoretical tool. It often has practical implications, but there are also situations where an algorithm with theoretically worse runtime complexity will be faster for sufficiently small inputs.
 
I mean "sufficiently small" can also easily be far larger than you'd ever care about for really well-studied problems where there's something with like, polylog complexity that's theoretically better but only with inputs in the zillions or whatever
 
Right
 
10:50 PM
 
11:13 PM
does search not like preformatted text? I tried searching for two strings, one of which was in preformatted text and one which was not, and the search failed, but if I searched separately, the correct post was in the search results.
 
11:40 PM
@RadvylfPrograms alternatively, train everyone to expect an implicit /j in contexts where it's obvious you aren't being srs :p
 
-1
Q: Code Golf: "Code Golf"

DaCuteRaccoonIn this challenge, you must print the string "Code Golf." I'm curious what you come up with because unlike what you think, this will be pretty complicated. No literals. Rules The output can be anywhere you want (stdout, localhost, stderr, etc.) The output must be exactly the string "Code Golf," ...

 
00:00 - 13:0013:00 - 00:00

« first day (4267 days earlier)      last day (569 days later) »