« first day (3957 days earlier)      last day (53 days later) » 

12:02 AM
why
 
because rewrite
 
12:33 AM
CMC: print the sequence. only print n when if the first n can perfectly divided by first number of n then n is divided by first num of n and repeat until the length of n is 1.
 
i can't tell if i'm having a stroke or u are
4
do you mean 'first digit of n' when you say 'first number of n'?
 
@Rɪᴋᴇʀ first number of n is first digit of n
(ignoring when divide by 1 it runs in infinite loop)
 
if the first digit of n perfectly divides all of n? and you repeat that scenario on the new quotient?
 
if the n perfectly divides all of first digit of n?
then n is n divided by first digit of n
???
 
hit enter not shift-enter in textbox
 
12:43 AM
@Rɪᴋᴇʀ wdym?
 
i deleted the message since i hit enter accidentally
 
ok
do that.
 
@Fmbalbuena what does this mean?
that isn't a valid english sentence
 
like if n % n[0] = 0 then n = n / n[0] else don't
 
okay that makes more sense
 
12:47 AM
@Rɪᴋᴇʀ but don't if the first digit is 1
else runs in infinite loop
 
0
A: Sandbox for Proposed Challenges

DisplayNameNotFoundPrint random characters indefinitely Task Continuously print a random character (a-z, A-Z, 0-9) not separated by a newline (\n). Expected output b7gFDRtgFc67h90h8H76f5dD55f7GJ6GRT86hG7TH6T7302f2f4 ... Note: output should be randomised. Requirements Output must be continuous (i.e. never endin...

 
@Rɪᴋᴇʀ are you implementing?
 
in a minute i'll work on it, yeah, why?
@Fmbalbuena there's no reason to specifically call out forbidden loopholes - unless you have some to suggest, that is. you don't have to specify forbidden loopholes it's just a good idea if there's any major ones
 
@Rɪᴋᴇʀ more than a minute...
 
why are you so desperate for my answer dude? chill
i'm pretty sure that sequence can be reduced to something simpler to check against. since it could be broken down to some form of floor(x/10) in some cases, or smth like that
 
12:55 AM
@Rɪᴋᴇʀ ?
 
it also seems familiar as a problem statement (not quite this one but there's some sort of sequence derived from first digits that i can't remember right now)
i mean there's probably some easier way to determine if a number meets that criteria recursively than just doing that recursively
 
solve without golfing
 
this sounds like your homework now dude
also, what does 'no, not because different' mean on the sandbox comment? it's not the same challenge but i believe that sandboxed post is just a more specific form of the one I linked
 
@Rɪᴋᴇʀ I'm not at homework.
 
and that there's not really any new optimizations that could be applied to the smaller one
actually nah this goes as a comment
@Fmbalbuena this is also an annoying thing to test without a set of test cases. part of why i'm beginning to think there's a better way to do this is how rare numbers that meet those criteria seem to be
 
1:00 AM
@Rɪᴋᴇʀ the numbers is rare.
 
yes that's what i just said
 
first terms of this sequence is obviously 0, 1, 2, 3, 4, 5, 6, 7, 8, 9
but what if after 9
 
(ignoring multiples of 11 and 10, as well as anything starting with 1)
 
@Rɪᴋᴇʀ yeah
 
i consider the rules as given to mean that anything that starts with 1 immediately passes the test, due to looping forever
 
1:02 AM
@Rɪᴋᴇʀ yeahly
and dividing by 0
 
dividing by zero should never occur with the rules as given unless i'm missing something
n = n/n[0] is float division and unless you choose to keep leading zeros (which would mean everything instantly breaks due to divide-by-zero errors)
 
ok so do it now.
 
here's a list of the appropriate integers in the range 1-1000. i'll send my python code once i'm happy with it
 
really?
some starts with 1
don't do
 
you count 1 as being part of the sequence, which implies that 10, 11, etc. also are part of the sequence
also, 0 does not count as part of the sequence unless you've found a way to divide by 0
 
1:06 AM
@Rɪᴋᴇʀ not part of sequence.
 
@Fmbalbuena .
 
@Rɪᴋᴇʀ .?
 
the message i replied to lists 1 as part of the sequence
 
@Rɪᴋᴇʀ no, no, NO.
 
would you like to phrase this in a different way then
 
1:08 AM
@Rɪᴋᴇʀ please do it without starts with 1.
 
so 1 is a special case and doesn't count as starting with 1?
 
prints when the length of a number is 1.
 
but you wouldn't include 10 or 11 as a member of the sequence?
 
(except 1 because the length of a number is 1.)
 
1:19 AM
pretty sure no number only divisible by any single-digit prime (2,3,5,7) could ever meet this criteria (outside of those numbers themselves)
unless i'm tripping and missing something stupid
@Fmbalbuena can you give a single example of a number that meets these criteria? (more than the single digit ones)
I did my original code wrong so I'm not sure there even is one unless i'm missing something this time.
 
0
Q: Worst case of Slowsort

BubblerBackground Slowsort is an in-place, stable sorting algorithm that has worse-than-polynomial time complexity. The pseudocode for Slowsort looks like this: procedure slowsort(A[], i, j) // Sort array range A[i ... j] in-place. if i ≥ j then return m := floor( (i+j)/2 ) ...

 
1:35 AM
@Rɪᴋᴇʀ undesrtand?
 
understand what
 
oh there is no more than 1 digit number in my theory.
 
yeah i realized i was being stupid
 
because imagine the first digit and dividing to get one. is there way to get two?
 
all numbers when doing any division will eventually collapse to something coprime with that number
 
1:37 AM
Answer: Impossible
 
it would be more interesting if you stopped at any prime (assuming some prime checking function)
 
CMC print the sequence. only print n when if the first n can perfectly divided by first number of n plus 1 then n is divided by first num of n and repeat until the length of n is 1.
only diff is n can perfectly divided by first number of n plus 1
 
 
2 hours later…
3:11 AM
Tips for golfing in Whitespace: Remove unnecessary whitespace
8
 
3:34 AM
I wonder if there's a language based around making really long variable names
 
0
A: Sandbox for Proposed Challenges

Redwolf ProgramsImplement xorshift128+ I don't have time to finish writing this draft at the moment. Might also consider something like xoroshiro if it's more interesting to implement, but since xorshift128+ is so common it seems like a clearer choice. (Possible idea: Given initial seed, determine number of iter...

 
I swear NP/SP post faster than the button loads
 
Quick searching in esolangs gives a bunch of results that only allow 1-char variables, nothing related to long variable names
 
3:52 AM
though I can imagine a language where the variable name defines how it is computed, and then you need to use that name to reference it later
and reassignment trick doesn't work because reassignment only results in longer names
Or is it useless?
 
4:27 AM
*laughs in arbitrarily long variable names*
 
5:07 AM
@SandboxPosts I kinda want to mention the obvious problem with this and kinda want to abuse this when posted
@lyxal Lazylist printing is very cursed now
 
Wdym? I kinda like it
The spaces make things a little clearer
 
Nested ones tho
 
^ the dislike counter is back?
i went to a nearby mall around 2 months back and i went in a shop, and i found a plate that looked like cousins of @AaroneousMiller
 
5:57 AM
ok i got some names for a tacit language
here:
dinoux
flax
bpqd
tat
dnox
CMP: What name ^^^^ should i keep?
 
Flax
 
why do you like the same name as my brother (he suggested it lol)
 
It's the coolest sounding
 
it's also one of the only two that i immediately know how to pronounce
 
@RedwolfPrograms I've beaten NP before
Nov 23 at 9:02, by emanresu A
Hm, I beat the bot.
^^^^^^
@PyGamer0 because lyxal is your brother
 
6:12 AM
ok flax it is ig
 
Flux could also be good, your choice
 
OooOoOo New tacit language?
 
flux lol
flex?
 
FLOX
 
fl[a-z]x
 
6:16 AM
fl\wx
/fl\wx/i
 
ok
what
 
It's a regex that matches fl followed by any letter, number or _, followed by an x.
Case insensitive.
 
CMQ: Kitten, kitteh, kitter or katana?
 
I'ma need like, any context.
 
Sorry, no context allowed, this is the TNB
 
6:21 AM
@emanresuA kitkat
 
kontesst
 
@emanresuA Rɪᴋᴇʀ
@emanresuA python+random:print(random.choice(["Kitten","kitteh","kitter","katana"]))
      ⎕IO←0⋄⍳10
0 1 2 3 4 5 6 7 8 9
oh cool i installed some userscripts
and chat is a lot better now
 
@emanresuA knitting
 
¯\_(ツ)_/¯ I give up
 
6:45 AM
@emanresuA Catti
 
hello
 
@emanresuA Kattis
 
7:23 AM
AoCG is a work in progress... Hopefully we can finish stuff by the time it's due to post
 
8:19 AM
@PyGamer0 Is that the Chat Exec script?
Woo, I'm the only one ever to earn the dyalog badge.
6
 
@Adám yes
 
I use it too. Pure awesome.
 
@emanresuA I was somewhat busy today, but I assure you we'll have >25 candidates by tomorrow. I guess we'll have to choose which one to use or discard after that.
 
8:38 AM
> the The Nineteenth Byte
 
@Bubbler No pressure, it'll probably be fine if we finish some after 1st december
Since we can post preprepared ones during that time
 
CMP: Should i create the codepage first or the language?
 
@PyGamer0 if you want to go the Vyxal route, where the codepage is fairly meaningful (not just random letters), then create the language first and make the codepage fit around it
otherwise, it's fine to make the codepage first
 
9:13 AM
if i am right Try it online! just adds 1 to 1 and subtracts 1 from that and muliplies 1 to that outputing 1
so 2+ should give 4
 
9:35 AM
ok i think i understand a little of jelly's tacit system
 
Are you learning Jelly or trying to remake it?
 
@PyGamer0 tbh I found the cheatsheet easier to understand than the tutorial
trying to make sense of it as if it were intuitive just confused me
but a system of rules? that I can learn!
 
10:33 AM
@RedwolfPrograms Yes, Verbosity
 
@emanresuA i am kinda learnin it so i cannot make another clone of it while i am makin my tacit lang
@pxeger i just took the links part of the tutorial
 
Hey this reminds me of that one time I tried to make my own tacit language

 Lyxal's Quest for Tacit

Imma make a probably cringe Jelly clone
Well that's one way to populate a frozen chat room.
 
lol
 
10:38 AM
I didn't get too far into it
And looking at it now, it makes no sense at all
 
@lyxal lol
@lyxal you just made a fizzbuzz demo and nothing else
 
@PyGamer0 I swear I also had more notes on paper about it too
 
i thought of a tacit system, then i realised its just jelly's but worse
 
Welcome to the club
I had no clue what I was doing
 
@lyxal did you ever make anything after that?
 
10:45 AM
@PyGamer0 nothing explicitly tacit
 
@lyxal so you have implicit tacit languages?
 
@PyGamer0 stack based is technically tacit
 
CMQ: Is English tacit?
 
no
 
why?
 
10:54 AM
english refers to its 'arguments' with pronouns and things like 'the'
'the cat sat on the mat' - not tacit
'cat sat mat' - maybe tacit?
 
yeah the mat sat on the cat
makes sense
 
lol
 
11:08 AM
pro-drop natural languages are tacit then, clearly
 
@UnrelatedString like what?
cat mat sat hell well
 
...went to look up a good canonical example of pro-drop and til that the pro stands for pronoun
obvious in retrospect
but all along i thought it was like
pro-drop versus anti-drop
 
lol
 
11:55 AM
REEEDDDWOOOOOLLLFFFFF!!11!!!1!!111!!!1!!11!111
NP is no.
it missed a question
0
Q: SQL Christmas Code Golf Challenge: PRON Christmas Tree generator

Antoine Reinhold BertrandI wish all of you a reflective advent season. If anyone like to play some code golf, here your challenge: Write the query that generate a similar christmas tree in less signes than I did. But also any other generated Christmas ASCII art in SQL is welcome. WITH recursive cnst as ( SELECT 32 as...

 
i don't understand that unicode hellscape
 
12:12 PM
...why can sql even do that
 
it is what it is
 
12:28 PM
Christmas spirit lets you do anything
Can’t wait for winter break, Thanksgiving was too short
 
12:44 PM
At least you have Thanksgiving. We just have Halloween, then nothing til Christmas
 
^
 
And Halloween doesn't even have a proper holiday around it :P
 
1:11 PM
@cairdcoinheringaahing we have a bunch of holidays i think
*festivals
 
oh yeah i should make a christmas pfp since i'm in the habit of actually changing my pfp here
 
1:55 PM
> CoGoSO
 
cogoso?
 
2:28 PM
Ooh, my school's playing christmas music in the hallways now
And I've switched to my christmas pfp
 
2:48 PM
CMC: Error if the input contains non-ascii, else do nothing.
 
ASCII or printable ASCII?
If it's printable: x=>x>'~'|x<' '&&a
If it isn't: x=>x>'\x7f'&&a
(You can replace \x7f with a literal 0x7f character in most implementations)
 
printable ascii
 
3:08 PM
Hello.
 
@AlanBagel APL, 12: {}1÷2|' ~'∘⍸ Try it online!
 
was the message you pinged me in important
 
It looked like it was just ASCII art of someone waving hi
 
3:15 PM
@RedwolfPrograms you mean: o/\/
 
,.,_/¯\_/¯\o
ASCII rattlesnake
 
----_-o
 
MPCC: Print quine but your code is beer shaped.
 
@Fmbalbuena What counts as beer shaped?
 
> Make a qwine: a quine shaped like a wine bottle
FTFY
> ASCII
> ¯
 
3:25 PM
@AlanBagel Any.
 
@tjjfvi Shhh :p
 
MPCC is Mini Popularity contest challenge
 
,.,_/'''\_/'''\o
ASCII rattlesnake
 
@RedwolfPrograms ?????
 
     _   _
,.,_/ \_/ \o
ASCII rattlesnake
@Fmbalbuena No objective scoring criterion; closed as off-topic
 
3:28 PM
,.,_/`-.,/''\o
@tjjfvi you can't only voting
 
Ok, 11260 bytes in my language "99 bottles of beer on the wall"
The way the language works:
If the program is the text of "99 bottles of beer on the wall", print the text of "99 bottles of beer on the wall"
Otherwise, interpret it as golfscript
 
@tjjfvi program
 
So the text of "99 bottles of beer on the wall" is a beer-shaped quine in it
 
@tjjfvi not beer shaped; no stars.
 
You didn't specify what beer-shaped meant
My program is very beer-related
 
3:37 PM
beer shaped means bottle beer shaped.
 
It has been shaped by the beer
It is beer-shaped
 
15 mins ago, by Alan Bagel
@Fmbalbuena What counts as beer shaped?
12 mins ago, by Fmbalbuena
@AlanBagel Any.
 
Exactly
 
yeah
but the program shape doesn't look like beer
 
When did "beer-shaped" become "shape must look like beer"?
I thought it meant anything
I still hold that my program is beer-shaped, as it has been shaped (read: molded, formed) by the beer
 
3:40 PM
@tjjfvi shape must look like beer like: bottle of beer or glass of beer.
 
You can't substantially change the challenge rules after answers have been posted
 
@tjjfvi They pretty clearly don't mean "shaped by beer"
 
@Fmbalbuena if anybody wants to solve this one in piet (interpreting beer-shaped as 'code when viewed as image looks like beer') i'll buy you a beer when legal/appropriate
 
That's not cool
 
@tjjfvi They're not changing anything
 
3:41 PM
@Rɪᴋᴇʀ piet? graphical output don't exist but yeah
 
> What counts as beer shaped?
> Any.
 
@tjjfvi That was the previous specification of the challenge
 
Almost certainly due to a language barrier
They most likely meant "any beer"
 
Ah, that's not how I took it. If that's the case, my apologies.
 
3:43 PM
why not making program?
 
Maybe people don't find it an interesting challenge
 
PHP, 1 byte: 🍺
/s
Can't get more beer-looking than that
Actually that's not 1 byte
It's 4
I'm dumb
 
PHP with an SBCS :p
 
It's not supposed to have that header and footer
 
3:46 PM
@Fmbalbuena i just assumed output would be the byte sequence that maps to the .png file of the source ubt yea
 
@tjjfvi but in code.golf errors
 
@Fmbalbuena It doesn't have to work in all implementations, it just has to work in one
@tjjfvi Bonus points because this is also a polyglot with HTML and /// (and prbly more idk)
 
Text, and also any languages that just print anything unrecognized
I think Keg does that
 
@RedwolfPrograms can confirm; it do
 
3:49 PM
@AlanBagel Do you like this
 
@Fmbalbuena Yes
 
(not for alan bagel)
@AlanBagel maybe do you like First alan Becker video
 
@Fmbalbuena I did watch that.
 

« first day (3957 days earlier)      last day (53 days later) »