« first day (2398 days earlier)      last day (2447 days later) » 

4:00 PM
plus one
divided by 2
 
Nevermind
Then there's n*1.618033988749895 as well :0
 
>:U how much precision do you want
 
:P 2B decimal places
 
4:06 PM
@Mr.Xcoder i forgot my supercomputer though
 
@Mr.Xcoder you can't get that much with doubles
@Mr.Xcoder you just need the decimal module and patience
You should only really need like 4 GB RAM probably
 
>:U what is patience
 
@Mr.Xcoder SOGL, 5 bytes, ~200 decimal places
 
@dzaima d drive?
 
@totallyhuman patience
 
4:11 PM
@dzaima are you secretly a sock of phase
 
@ASCII-only :/ I often accidentally permalink from my local copy
 
@LeakyNun Alright, I found the error. maximum recursion depth exceeded in cmp\nError: None is not the correct type
 
Is there a way to become the RO of a room with no ROs?
 
mods, probably?
 
CMP: Where do you keep your throwaway scripts or files or the like that you use for golfing? For me, they're under C:\Tools\Scripts\Golfing
 
4:16 PM
@AdmBorkBork Desktop/Golfing :P
 
@Sherlock9 nice
 
@StepHen Python 3, 42 bytes: n=64¶while n^90:n=n+1^32;print(end=chr(n)) Lot's of bytes to be saved if the output format isn't strict.
 
@Mr.Xcoder Oh, you're one of those people. ;-)
 
~/Downloads/Workspace/code-golf ;-;
 
Home directory.
 
4:17 PM
one of these days, i'm gonna wipe chrome os off and install ubuntu on this
 
@AdmBorkBork ~/.trash
 
@AdmBorkBork desktop/stuff/. Most of everything is in stuff.txt which is only 302kb
 
@WheatWizard I think there are automatic script in place that will eventually choose a room owner. A mod might speed things up though.
 
@WheatWizard that's r00d to golfers :(
 
4:18 PM
@Dennis This has been without an RO for a while, could you intervene?
 
.oO(There are currently 1504 files/directories in /home/dennis.)
 
...what
 
@totallyhuman /home/dren/Git/golf
 
Before PowerShell was open-sourced and available on TIO, I had to do everything locally. I have 601 files inside C:\Tools\Scripts\Golfing
 
@Mr.Xcoder hey i see braille
 
4:20 PM
I see much more
 
...wait, you're not supposed to see braille
 
@WheatWizard It has a RO. That's why the system didn't step in.
 
- what
@Dennis Wait, ais is no longer among us
 
Tell that to chat.
 
Well, yeah
 
4:21 PM
@Mayube Git/?
 
How else can a room have no RO other than deleted users?
 
@totallyhuman yes
 
@WheatWizard Made you RO.
 
@Dennis Thanks!
 
4:23 PM
@Mr.Xcoder What happened ais?
 
@Mayube ...so you git your code golf stuff?
 
*to
 
they left
 
@Sherlock9 Left because they hated SE
 
got their account deleted
 
4:24 PM
Ah dang
 
@totallyhuman most of the directories in ~/Git/golf are git repos
Emphasis on Most
 
Anybody else left or disappeared over the past ... 6 months or so?
I actually don't remember when I disappeared
 
that's a very suitable alias
 
XD Beautiful
 
4:29 PM
that's going in my .zshrc for sure
 
$ cat /bin/wtf
man $2
$ wtf is man
MAN(1)
still one of my favourite ones :P
 
That's nifty
 
@totallyhuman That's going over my head, unfortunately
 
CMC: Given N, return the N'th digit of DJ's self-describing sequence. To create DJ's self-describing sequence, start with the digits 0-9, then repeatedly append the digits of the current length of the sequence. So when you have [0, 1, 2, 3, 4, 5, 6, 7, 8, 9], the sequence has 10 items, so you append a 10. [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 1, 0] has 12 items, so the next step is [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 1, 0, 1, 2], and so on and so forth.
 
@Sherlock9 what part don't you get?
 
4:35 PM
both man $2 and MAN(1)
 
$2 is just "the second command line argument"
 
@DJMcMayhem SOGL, 8 bytes: [ 0.{l+}W](dzaima.github.io/SOGLOnline/…) (1-indexed input)
 
MAN(1) is just a snippet of man's man page
 
Oh and cat. I forget what that is
 
cat just prints the contents of the file
 
4:38 PM
Some test cases:
 
in this context anyways
 
1   --> 1
2   --> 2
...
12  --> 1
42  --> 4
100 --> 1
300 --> 8
 
@totallyhuman so wtf is man returns something like Man is man?
Sorry for being so dense
 
nah it just does man man since $2 is the second argument
if /bin/wtf was man $1, then it would do man is
 
@DJMcMayhem So 0 is the 0-th digit? shudders
 
4:42 PM
Hmmm. Positive N?
 
def dj(n):
    s=list(range(10))
    while len(s)<=n:s+=[int(d)for d in str(len(s))]
    return s[n]
 
This was inspired by a new V feature that inserts the current column, but V will never have something in the 0th column
 
@totallyhuman I see. Kind of neat
 
@DJMcMayhem wait how would the 100th item be 100 if each number is a single digit?
 
4:45 PM
How did I miss that?
WTH
It's supposed to be 1
@Dennis Could you edit that?
 
Done.
 
Can my program be 1-indexed?
 
So 1-->0?
 
Yes
Although I realized what I was doing was wrong anyway
 
4:50 PM
CMC or Main?: Given a flat list of data and an arbitrarily nested ragged array with as many leaf nodes, fill the ragged array with the flat data.
 
So mold?
Like in Jelly?
 
E.g. [2,13,7,9,10,6,12,1,11,8,3,4,5] and [0,0,0,[[0,0]],[0],0,[0,[0,0],0,0],0] gives [2,13,7,[[9,10]],[6],12,[1,[11,8],3,4],5].
 
jelly: <mold built-in>
 
@totallyhuman
 
4:52 PM
@totallyhuman Nu-uh, You are not beating me to the answer that I mentioned first. Jelly, 1 byte:
 
Eww, moldy jelly.
7
 
@AdmBorkBork More like jelly mold.
 
Jelly mold is all very nice fellas, but let's see some other languages.
 
this could be a main challenge though
 
4:54 PM
@DJMcMayhem Proton, 67 bytes:
n=int(input())
l=[]
while((d=len(l))<=n)l+=list(str(d))
print(l[n])
 
it's probably much trickier in practical languages
@BusinessCat have you just switch from python to proton ಠ_ಠ
 
@totallyhuman brb rewriting Gaia in Proton
 
ಠ_++ಠ
...i'm not fixing that
 
@totallyhuman Proton lets me do stuff like while((d=len(l))<=n) so yes
 
@Adám SOGL, 3 bytes: 0;ŗ (it expects both inputs (the node array as string and number array as array) on the stack so ,,→ is added for ease-of-use) :p
 
4:57 PM
@dzaima Can you explain it for me?
 
@Adám replace in the string 0s with the corresponding number :p
 
@LeakyNun Odd question, what is best way in Jelly to do repeat <last link> until length of <last link>'s result (which is a list) is greater than <left arg>?
 
@dzaima Ah, but what if the structure has random values?
 
@Adám is that allowed?
 
@dzaima I never stated what the ragged array would be filled with.
 
4:59 PM
@Sherlock9 use the while quick
 
@Sherlock9 Something like ÇL2>¿ I think
 
@Adám you gave an example of 0s so I expected that
 
Ah, so why doesn't

;LDF
⁵ḶÇL<³¿

work?
 
because you haven't grouped your atoms...
 
...that looks surprisingly monospaced
 
5:00 PM
@dzaima Well, I never actually posted a challenge. I only asked whether to CMC or Main.
 
I need to refresh my chain knowledge
 
@Adám ah, I read it like CMC (or [maybe] main)
 
@Sherlock9 ¿ pops two atoms
 
@dzaima I guess I shouldn't have made CMC bold. Habit.
 
here, < and ³. It keeps doing < until the condition ³ is true
 
5:01 PM
hah
 
btw, I think I started the trend of bold-facing CMC. I thought it would be nice to have them stick out.
 
@LeakyNun Alright how about ⁵ḶÇL³<¿?
Oh wait
DJ's self-describing sequence, Jelly, 16 bytes (1-indexed): tio.run/##ASYA2f9qZWxsef//O0xERgrigbXhuLbDh0w8wrMkJMK/4buLQP///…
 
you know what'd be cool
a jelly verbose mode
 
@totallyhuman you mean every character replaced by a keyword?
 
yeah pretty much
 
5:09 PM
And maybe some parentheses
 
but charcoal handles this exceptionally well imo
 
That would be relatively easy for regular (nil|mon|dy)ads, but the quicks would be a pain
 
@DJMcMayhem Why?
 
Dennis was talking about overhauling Jelly a few months ago, but he said that he was prioritizing TIO first
I assume that hasn't changed much
 
@totallyhuman I thought about that. Maybe for Jelly 2.
 
5:11 PM
@Adám Because they all function differently. Unlike the *ads
 
atoms
use the word atoms :P
 
Oh yeah
I knew that
 
@totallyhuman Dyalog APL's RIDE interface has an option to show explanation tooltip when hovering over a primitive. APL+PLUS used to have a keywords mode so you could swap between glyphs and words.
 
does this gravitational implosion make sense
 
@KurtG no just from the sound of it
:P
 
5:12 PM
@KurtG Wrong room?
 
I guess you could write quicks like normal functions like cumulativeReduce(concatenate)
idk
 
wait
 
do u see it?
its a simulation
and this is code room
 
@DJMcMayhem Keywords are really just an additional parsing step. Functional parens would make it an entirely different language.
 
since jelly is tacit, maybe the verbose mode should look tacit
 
5:13 PM
@BusinessCat Just concatenate cumulativeReduce
@KurtG No, this is code golf room. We write short code.
 
> For example, a sequence of operations in an applicative language like the following:

def example(x):
y = foo(x)
z = bar(y)
w = baz(z)
return w
...is written in point-free style as the composition of a sequence of functions, without parameters:[3]

def example: baz bar foo
 
@totallyhuman But machine-translation of such is hard
@totallyhuman Just replace each primitive with its name and a space.
 
@Dennis I'm trying to find what you said several months ago about your future Jelly plans, but I forgot how crap chat search is
Something about replacing all the loopy non-ASCII characters with something nicer and more verbose that turns into some sort of bytecode
 
@totallyhuman E.g. tacit APL: +/÷≢ in keywords: Plus Reduce DividedBy Tally
 
@Dennis I meant if the verbose output had parens. So you can see the argument flow
 
5:19 PM
@DJMcMayhem I've made a tool to explain tacit APL as explicit expressions.
 
It is entirely possible we discussed all that in the Jelly room and not in TNB. Or another room entirely :/
 
Most likely, yes.
 
@EriktheOutgolfer ughhh
 
@totallyhuman Half of them are hyperneutrino
 
@LeakyNun you can just reduce by lcm btw :p
 
@Sherlock9 I intended you to port my whole thing, not just the limit
@EriktheOutgolfer then it would not be portable to parenthetic
 
oh you trying to do it in parenthetic?
 
5:32 PM
@EriktheOutgolfer yes
 
yeah parenthetic doesn't have reduce :/
but maybe somebody can make something recursive that essentially reduces
 
@EriktheOutgolfer that's what I'm doing
 
hi
 
@LeakyNun can I assume that x >= 2 or x > 2?
or must I support x == 1 as well?
 
@EriktheOutgolfer ask sherlock
 
5:38 PM
@Sherlock9 ^^^
 
Sorry? I don't quite get the question
 
well, can we assume that x would be at least 2?
like, lcmorial(2) = lcm([1, 2]) = 2
or should we support something like lcmorial(1) = lcm([1]) = 1 as well?
or even lcmorial(0) = lcm([]) = 1?
 
You have to support f(0)=f(1)=1
Empty products count, too
 
ah ninja'd
 
@Mr.Xcoder I think I've fixed that now
 
5:42 PM
@Sherlock9 heh
 
@EriktheOutgolfer no, I'm not seeing any modification that will enable us to work with 11
that is, under 1000 recursions
 
hold on I think I've almost made something non-recursive
but I'm afraid parenthetic doesn't support variable assignment
 
@EriktheOutgolfer it does
but it doesn't have loops
 
@LeakyNun oh right ()
and no it doesn't have loops >_<
@LeakyNun anyways if somehow this can be recursive
def f(n):
  x = 1
  y = 1
  z = 1
  while z <= n:
    while x % z > 0: x += y
    y = x
    z += 1
  return x
 
@EriktheOutgolfer it doesn't have modulo
trust me, my code is equivalent (or maybe better) than what you have in mind
 
5:49 PM
@LeakyNun yeah that's something that we'd need to define recursively
caret reply = >_<
@LeakyNun yeah possibly
 
is there no way to build a function in Python, except maybe "eval"?
 
there's no "eval"
or at least if the docs aren't lying
 
@EriktheOutgolfer in $\Huge{\text{Python}}$
 
oh I thought you meant python function in parenthetic
@LeakyNun and somebody is growing fast :p
 
10 9 1 1 10 5.0
10 9 1 2 20 5.0
10 9 1 3 30 5.0
10 9 1 4 40 5.0
10 9 1 5 50 5.0
10 9 1 6 60 5.0
10 9 1 7 70 5.0
10 9 1 8 80 5.0
10 9 1 9 90 5.0
10 9 1 0 90 5.0
90 8 90 90 90 5.0
90 8 82 82 90 5.0
90 8 74 74 90 5.0
90 8 66 66 90 5.0
90 8 58 58 90 5.0
90 8 50 50 90 5.0
90 8 42 42 90 5.0
90 8 34 34 90 5.0
90 8 26 26 90 5.0
90 8 18 18 90 5.0
90 8 10 10 90 5.0
90 8 2 2 90 5.0
90 8 2 4 180 5.0
90 8 2 6 270 5.0
90 8 2 8 360 5.0
90 8 2 0 360 5.0
360 7 360 360 360 5.0
360 7 353 353 360 5.0
360 7 346 346 360 5.0
 
5:53 PM
@LeakyNun Link is too long to post
 
This is what my code does to compute 10!
 
And it doesn't work
 
@Sherlock9 gist
 
at least managed to get rid of the %
and apparently it's already done
def lcmorial(n):
  def mod(n, m):
    while n >= m: n -= m
    return n
  x = 1
  y = 1
  z = 1
  while z <= n:
    while mod(x, z) > 0: x += y
    y = x
    z += 1
  return x
now for the recursion (which is probably already done)
 
5:58 PM
@Sherlock9 because there really is parenthesis mismatch
> (() (()()))) i
 
@LeakyNun Edited
 
@Sherlock9 collision between l and if?
actually all variables are global
 
Yeah but who knows with the parser
I'm going to try six pair variables with everything for the time being
 
@LeakyNun @Sherlock9 did it with fewer variables (still up to N = 10 for TIO at least)
mod = lambda n, m: mod(n - m, m) if m <= n else n
lcmorial = lambda n, x = 1, y = 1, z = 1: (lcmorial(n, x + y, y, z) if 1 <= mod(x, z) else lcmorial(n, x, x, z + 1)) if z <= n else x
 
no way
 
6:05 PM
and tested it until N = 10
 
@EriktheOutgolfer Well, I didn't understand how Leaky's code worked, and I'm not sure how your code works either, but I'm implementing it anyway
How high can you go?
 
N = 10 (like leaky's)
1: 1
2: 2
3: 6
4: 12
5: 60
6: 60
7: 420
8: 840
9: 2520
10: 2520
 
1
2
4
6
12
24
36
48
60
120
180
240
300
360
420
840
1680
2520
 
@LeakyNun those are the intermediate numbers
I'm sure @EriktheOutgolfer understands
 
6:09 PM
yeah it's the values x takes at every call to lcmorial where z gets incremented
 
10
20
30
40
50
60
70
80
90
180
270
360
720
1080
1440
1800
2160
2520
this is my version
 
Ah wait. Should have just said I updated the old gist
Still using Leaky's version for now
 
@LeakyNun heh we both get 18 numbers
 
actually guess what, I should do it in lisp
 
Give that I am defining subtraction of strings as a-b=a.replace(b,""), how would you logically define division of strings? I was thinking removal from a of all characters in b...?
 
6:13 PM
@SocraticPhoenix division is related to multiplication
 
multiplication is defined by two main challenges :p
 
I haven't defined multiplication between strings yet :(
I probably won't either... since it'll break things
 
well division is defined such as if x / y = z then y * z = x so you need multiplication
or y * (x / y) = x
 
@muddyfish Yep, seems fixed
 
@EriktheOutgolfer oh duh... it'd be the inverse of multiplication... but... well what's the inverse of nothing? I guess I'll just define it illogically xD
 
6:16 PM
then why call it division? :p
 
@EriktheOutgolfer because I want to use the / operator
 
maybe you wanna save it for sometime when you would have defined multiplication
and there's % which fits better imo
 
(inverse of nothing) = (inverse of zero) = 1/0 = infinity. QED
 
what
no
 
zero means nothing
 
6:18 PM
@Sherlock9 lisp
 
@totallyhuman I said, "QED." :p
 
there's so many only one thing wrong with that proof
 
well there's the empty set too?
 
(inverse of zero) = 1/0
 
1/0 = undefined not infinity lol
 
6:20 PM
^ i was going to say
1 / 0 = UNDEFINED
because division by zero is undefined by its own nature
 
0 does not have a multiplicative inverse
 
mhm
 
Depends upon how you approach it.
 
that's two horribly different meanings of inverses
 
It does have an additive inverse
 
6:22 PM
basically an inverse is a function f' that undoes the effect of another function f
 
1/0 is undefined but lim(1/x->0) -> infinity
 
I suppose I should have said +/- infinity.
 
One may say that $\frac{1}{0}=(-\infty,+\infty)$ :P - undefined is the answer
CMC: Given a positive integer k and a list of integers l, return all the numbers in l that have exactly k prime factors.
 
5 bytes in jelly? I think, maybe 6
 
6:29 PM
@BusinessCat Duty fulfilled [1,2,3,4,5,6,7,8,9,10,11,12,13], 3 -> [8, 12]
 
<built-in for prime factors><built-in for length><built-in for equality><built-in for filter>
 
NOTE: primefac(16) = [2,2,2,2]
 
param($k,$l)function f($a){for($i=2;$a-gt1){if(!($a%$i)){$i;$a/=$i}else{$i++}}};$l|?{f($_).count-eq$k‌​}
 
@totallyhuman Not in Jelly :)
 
Oh, prime factors
nvm
 
6:30 PM
@Mr.Xcoder hmm?
that is 6 bytes i think
 
@totallyhuman Because Jelly returns [[2, 4]] for 16, not [2,2,2,2] :)
 
@Mr.Xcoder Gaia, 6 bytes: ⟪ḍl=⟫⁇
 
jelly 7 bytes: ÆfL⁼ðÐf
 
I think you'd just need to finangle the return of f($_) to match only prime numbers, and then get the .count of that. So, in other words ... lots of bytes.
 
Pyth, 7 bytes: fqQlPTE
@BusinessCat gaia beats both Pyth and Jelly
 
6:32 PM
because it has single-byte builtin
and single-byte meta
 
Pyth does too, but it has other boilerplate
 
even though it requires two byte ⟪⟫
 
Gaia loses horribly when auto-vectorization is relevant though
 
That's also true
 
@EriktheOutgolfer that's about what i said
 
6:34 PM
yeah I don't think 6 bytes is really possible though
@Mr.Xcoder no
there's also Æf which does return [2, 2, 2, 2]
 
what's ð though
 
start new dyadic chain
 
ctrl+f on atoms page shows all d's
 
the Ðf consumes it so it consumes the entire previous chain
 
which is annoying af
 
6:35 PM
@totallyhuman not an atom but syntax
 
Everyone's here talking about these esolangs with less-than-10-byte solutions, and I'm just over here like "Here's a 100-byte partial solution, lol."
 
powershell isn't made for such things lol
 
i'd've never expected charcoal to be the top most answer on my challenge O_O
8
A: Oreo? No... Lollipop, maybe?

NeilCharcoal, 73 bytes θ§⪪”%↖↙1¬¢/vy⁵⸿ψJPP±≔S×5Jρνξ–Gu ◧;Yx³F▶ψ;εB↥:P¹N﹪J$α✂χ✳⦄⟲*±¶Sp:ς↘V◧◧”x℅θ Try it online! I/O is in lower case. Based on this verbose version. Explanation: Implicitly print: θ Input character Implicitly print: ”...” Lon...

 
@EriktheOutgolfer PowerShell isn't made for a lot of things I use it for on this site.
 
and that's what we call a real challenge
 
proton changed from the roots
 
wat
> Even worse fix to bad bug fixed again
ERROR: cannot parse statement
 
wait so it was == and you wanted it to be <= but you were confused with >= and then realized that "oh it should be <="
oh you switched the <= and => right?
 
Well they are <= and >=. At first they were the same because I copy-pasted and forgot to change, so I fixed it by changing the wrong one and they were backward
Then had to fix again
 
6:42 PM
whoa gaia's operators code is actually nice
 
then look at the date builtins
 
that's impossible
 
@LeakyNun For some ridiculous reason, the code now prints triangular numbers
Updating the gist momentarily
 
Everyone's looking at my code... expecting to get flamed for using tabs in 3, 2, 1...
 
@Sherlock9 ridiculous reason = "laziness I don't wanna admit" :p (or is it?)
 
6:44 PM
@EriktheOutgolfer It's almost 2 am
I'm just a data entry guy at this point
 
maybe you should rest data entry starts to get tired...
 
good grief, there's a version history
 
@totallyhuman Is it just me or is the "ungolfed and readable" less readable
 
> Notes

- None
 
6:57 PM
The way it's worded is kind of unusual but its not uncommon to keep track of golfs like that
Like "-10 by blah blah"
 
yeah but they assign version numbers to each lol
 
@BusinessCat The game started, in case you wanna play
 
Looks like all of their answers are the similar format.
 

« first day (2398 days earlier)      last day (2447 days later) »