« first day (170 days earlier)      last day (1432 days later) » 
12:00 - 19:0019:00 - 21:00

12:46 PM
Hello anyone!
 
@cairdcoinheringaahing Can you please think of a CMC?
 
@Mr.Xcoder I'll try :P
CMC: Given 2 positive integers between 1 and positive infinity (a and b), and an integer between 1 and 4 (n), perform either root mean square, arithmetic mean, geometric mean or harmonic mean on a and b, depending on n. You may choose the mapping
 
uhmmm
 
Totally 100% original :P
 
That's definitely gonna go over 15 bytes for me
@cairdcoinheringaahing Any idea why V doesn't work?
Æm
P½
²SH½
PH÷S
Ŀ
 
12:55 PM
@Mr.Xcoder Ŀ isn't implicit, you have to tell it which link to run
 
okok
 
1 have 19 bytes
 
@caird 18 bytes
 
Although mine doesn't seem to work?
 
12:56 PM
@Mr.Xcoder In what way?
 
wait...
@cairdcoinheringaahing 18 bytes.
Wait, is that yours too?
 
@Mr.Xcoder 18 bytes
I think we had the same idea :P
 
PH÷S doesn't seem to work for mine...
 
@Mr.Xcoder In what way?
 
@cairdcoinheringaahing We should use instead of H
 
1:01 PM
@Mr.Xcoder Oh yeah :P Although I was using 2÷İS$ until you posted your code :P
ಠ_ಠ I just realised that I've been using ×/ instead of P in my replacement atoms gist
 
@cairdcoinheringaahing Why not just İSHİ
 
@Mr.Xcoder Because I chose the longer way :P
 
Basically it's 1/(x/2) instead of 2/x
And surprisingly it's golfier ಠ_ಠ
 
@Mr.Xcoder Yeah, that's Jelly for you.
If it's long in maths, its short in Jelly, and vice versa
 
I see. I will come up with a CMC now
CMC: Given a list of positive integers, get the ratio between their RMS and HM.
(cc @cairdcoinheringaahing)
 
1:06 PM
define("RMS" && "HM")?
 
@cairdcoinheringaahing Root mean square and Harmonic mean.
ಠ_ಠ
 
13 bytes ಠ_ಠ
@Mr.Xcoder Example?
 
[6, 7] -> 12.980740866741112
ಠ_ಠ Mine only works for lists of two-elements.
@cairdcoinheringaahing 12 bytes: L÷İS$µ³²SH½+
 
@Mr.Xcoder Are you sure you mean ratio? RMS of [6, 7] => 6.46 and HM of [6, 7] => 6.52 so shouldn't the ratio be 1.01?
 
@cairdcoinheringaahing Sum, sorry ;_;
Excuse
me
Up for another CMC?
 
1:16 PM
Sure. Do you want to make one or should I?
 
I think you should
But pls nothing that involves strings.
 
How about parsing?
 
Oh no :'-(
 
@Mr.Xcoder Ok, I had a Calvin challenge in mind, but thought it would be very difficult :P Thinking of another one
 
I think we should do some CMCs with Levant and Cthulhu too
 
1:19 PM
@Mr.Xcoder That could be fun :P
I have a main question that doesn't have a Jelly answer yet. Should we try it?
 
I am planning to add a bazillion built-ins to it
@cairdcoinheringaahing Ok, which?
 
64
Q: Calculate Phi (not Pi)

El'endia StarmanNo, I don't mean ϕ = 1.618... and π = 3.14159.... I mean the functions. φ(x) is the number of integers less than or equal to x that are relatively prime to x. π(x) is the number of primes less than or equal to x. Let's say that "not pi" is then π̅(x) and define it to be the number of composites...

 
:O that has no Jelly answer?
Sure let's try
 
@Mr.Xcoder It's from 2015
 
And it's damn easy in Jelly
@cairdcoinheringaahing How many bytes to do you have rn?
 
1:24 PM
@Mr.Xcoder 7 but its failing for one of the test cases
 
@cairdcoinheringaahing I have 6.
Doesn't fail for any test.
 
Huh, I have 8 bytes
@Mr.Xcoder How do you implement π̅(x)?
 
And I have a very nice formatted output :-)
@cairdcoinheringaahing Count the primes less than X, subtract from X, decrement.
  1   0
  2   0
  3   0
  4   1
  5   1
  6   1
  7   1
  8   2
  9   2
 10   4
 11   4
 12   2
 13   2
 14   6
 15   4
 16   6
 17   6
 18   4
 19   4
 20  10
 21   4
 22  12
 23  12
 24   6
 25   8
 26   8
 27  16
 28   6
 29   6
 30  18
 31  18
 32   8
 33  12
 34  10
 35  22
 36   8
 37   8
 38  20
 39  12
 40  18
 41  18
 42  12
 43  12
 44  28
 45   8
 46  30
 47  30
 48  16
 49  20
 50  16
 51  24
 52  12
 53  12
 54  36
 55  18
 56  24
 57  16
 58  40
 59  40
 60  12
 61  12
 62  42
 63  20
Is the output of my program ^
 
@Mr.Xcoder Same here :P
 
My footer is 100RÇ€µ100R,µZG
Redundant but helpful
 
1:28 PM
@Mr.Xcoder Mine is 100R,Ç€ZG
 
Nice. Can I see your current code?
 
@Mr.Xcoder ÆPÐḟL’ÆṪ
 
Oh...
 
I known how to shorten it
 
Hint: ÆC
 
1:29 PM
6 bytes: _ÆC’ÆṪ
 
Exactly mine.
Byte-to-byte
@cairdcoinheringaahing Can I post as a CW?
 
@Mr.Xcoder Posting right now :P
 
ok ping when you post ;;
nvm
 
@Mr.Xcoder Posted
\o/ Beat 05AB1E by 2 bytes :P
 
I think the 05ab1e is golfable now
 
1:32 PM
:O it does have a Jelly answer by Dennis and we outgolfed him
 
@cairdcoinheringaahing I cannot see it?
 
I do see it now
I think we can golf ours though
 
@Mr.Xcoder How so?
 
Oh no we can't... Jelly's built-in for the thing I was thinking about is 2 bytes ;-;
@caird I added links to our profiles.
@caird I added an explanation as well.
 
1:40 PM
Yeah, I saw :P
 
How would one solve that challenge in Levant?
(don't ask about Cthulhu yet)
 
@Mr.Xcoder Hold on, opening the design page :P
 
And I think Gaia beats Jelly again.
 
Levant, 5 bytes: Č@_’Ť
 
Yeah Gaia beats Jelly
 
1:43 PM
@Mr.Xcoder 4 or 5 bytes?
 
5
Posted the Gaia solution.
 
ಠ_ಠ TIL you can't vote on your own CW's
@Mr.Xcoder Careful, we could attract attention from the Huskers
 
haha gaia code is so cute: ṗ⁈l(t
@cairdcoinheringaahing I can do it in Husk too, no problem :P
 
@Mr.Xcoder Come on, don't Leaky it
 
@cairdcoinheringaahing I won't (yet)
The fun fact is that Gaia is stack-based and really starts beating Jelly @caird
That's why I started learning it, and It's impressive
 
1:49 PM
@Mr.Xcoder I think it's the fact that the 2 most important builtins for that challenge are 2 bytes in Jelly and 1 in other languages :P
 
@cairdcoinheringaahing Not necessarily this challenge. Gaia's 1 byte built-ins are extremely carefully chosen.
 
@Mr.Xcoder brb, stealing them :P </joke>
 
I have 8 bytes in 05ab1e too, so meh: Lʒp≠}g<Õ
 
@Mr.Xcoder Alternately ḞCL’Ť
 
@cairdcoinheringaahing Nice... Kinda like Gaia I think
 
1:57 PM
Ḟ     - Filter keep items that
 C    -  Are composite
  L   - Length
   ’  - Decrement
    Ť - Totient
 
@cairdcoinheringaahing Why decrement ಠ__ಠ
1 is not composite.
 
@Mr.Xcoder I'm not able to test it, I don't know if it would work :P So ḞCLŤ should work?
 
Yes of course.
 
\o/ Levant FTW. What about Cthulhu?
 
I think it would be ~6 bytes
 
2:00 PM
so...languages based off of jelly do better than jelly itself
 
The Jelly algorithm.
@EriktheOutgolfer Not Cthulhu ;~;
 
@EriktheOutgolfer Stack-based ≠ based off Jelly
 
except that for example gaia has other jelly stuff like line links
(although that's adopted by many languages now including brachylog, husk, ohm, etc.)
 
Yeah btw I must solve that in Ohm... I just don't withstand not posting an answer in ohm
BLEH it's 7 bytes
@cairdcoinheringaahing Wanna get other old challenges and attempt them in Jelly?
 
@Mr.Xcoder Sure, but what tag?
 
2:07 PM
Numbers, those are its strength after all.
 
How about this? It has easily exploited bonuses :P
 
Um, let me read it
@cairdcoinheringaahing Sure, let's do it
@cairdcoinheringaahing Do you have anything so far?
 
@Mr.Xcoder Nope :P On my third approach
 
(nor do I)
That check for triangularity should be very easy though.... We are very dumb
 
\o/ 15 bytes
 
2:22 PM
I think I have less
brb
@cairdcoinheringaahing I guess you do use ×8‘Ʋ right?
 
@Mr.Xcoder Yeah
 
@cairdcoinheringaahing 12 bytes here.
 
@Mr.Xcoder Do you use #?
 
Of course.
Oh no sorry @cairdcoinheringaahing. I generated the first n whoops.
@cairdcoinheringaahing Make that 13 bytes.
 
For the record, mine is:
Ʋa×8‘Ʋ$$
0Ç#Ṫ
 
2:27 PM
Can I post mine here so that we can search for improvements?
 
@Mr.Xcoder Mine is 2 bytes longer :P
 
Yours is nearly identical, I just have a trick
Ik
 
@Mr.Xcoder is it the ×8‘Ʋ$$ part?
 
Of course
In fact the whole helper link.
 
I can't think of a shorter way to check for triangularity
 
2:29 PM
×8‘,µÆ²Ạ
0Ç#Ṫ
@cairdcoinheringaahing Mine is ^
 
@Mr.Xcoder That's clever
 
Ok, so let's do something: @cairdcoinheringaahing The one who gets the shorter solution posts. If the solutions are tied, then CW. How about this?
 
@Mr.Xcoder Sounds fair :P
 
And we do this for all the challenges we solve unless the solutions are dependent of each other
 
Although no Leakying. Once the Jelly answer goes up, we move to a different challenge
@Mr.Xcoder Agree
 
2:31 PM
@cairdcoinheringaahing Like, if I get 5 bytes based off your very clever 6-byter, you post it.
@cairdcoinheringaahing Agreed.
Ok, so I'll post now.
 
Yeah, sounds fairest. Also, given that we don't have to rush, explain answers as much as possible?
 
@cairdcoinheringaahing Sure.
And we always mention each other nonetheless.
 
@Mr.Xcoder Yep. Even if we didn't get the shortest one, we still helped :P
 
Sure.
Ok, I'll finish the explanation and move on to another one. Can you please look for another challenge in the meanwhile (no rush)?
 
@Mr.Xcoder Sure. I'm looking for a question with no Jelly answers :P
I've found one! Any thoughts on this?
 
2:38 PM
brb, finishing up EDIT: Done
@cairdcoinheringaahing Looks interesting, let me take a closer look.
@cairdcoinheringaahing Quite hard.
It's doable though. Any starting thoughts?
 
@Mr.Xcoder Check if a number has a 1 after the 2 :P
 
Oh that's it?
ಠ_ಠ Mr. Xcoder - I should read more carefully.
@cairdcoinheringaahing Anything so far?
 
@Mr.Xcoder Yeah, I've got 23 bytes and counting :P
 
Me too
Mine was invalid...
 
ಠ_ಠ I picked the wrong challenge, clearly :P
 
2:52 PM
Not necessarily :P
I have a very way way to generate [1, 2, 10, 11, 12, 20, 21, 22, 100, 101, 102, 110, 111, 112, 120, 121, 122, 200, 201, 202, 210, 211, 212, 220, 221, 222, 1000, 1001, 1002, 1010, 1011, 1012, 1020...]...
But not sure how to deal with 22 and 21 and such cases
@cairdcoinheringaahing ?
 
@Mr.Xcoder Coping this D:D
 
Oh ok, I am trying a sum of digits <= digit count technique
 
\o/ 23 bytes!!!!
 
nice
 
3:07 PM
ಠ_ಠ I need Dennis to commit a PR to save a byte
18 bytes
17 bytes
 
Can I see it? My approach seems a bit flawed
 
Hold on, testing it with all test cases
Never mind, didn't work
 
Aww :-(
@caird Mind if we pick another slightly easier challenge for now? I think I'll have to go for about ~1hour soon
 
@Mr.Xcoder Yeah, sounds better than continuing this torture :P
 
Great
I can't find any challenge ._.
 
3:15 PM
How about an easy one?
 
Sure, will be quite easy :P
@cairdcoinheringaahing 7 bytes.
 
@Mr.Xcoder Working on it :(
 
A 7-byter and a 8-byter
 
11 bytes
Working on golfing
10 bytes
Mine is ḲċЀØc$€S€. Any tips? @Mr.Xcoder
 
ċЀ and c$€S€ are different
I use some kind of intersection, if that rings your bell.
 
3:24 PM
7 bytes: Ḳf€ØcL€
 
Good!
 
@Mr.Xcoder Was that yours?
 
yes.
 
You get to post it then
 
@cairdcoinheringaahing Go ahead and post it.
 
3:25 PM
@Mr.Xcoder Why me?
 
Because I want you to. No community wiki.
 
@Mr.Xcoder Also, aside from the [] our TIO's are identical :P
 
Nice :)
 
@Mr.Xcoder Thanks (not really sure why though)
@Mr.Xcoder I'll make sure to credit you though
 
@cairdcoinheringaahing Because I have posted the previous one and really you have came up with it nearly independently. Just a very tiny hint doesn't matter much.
@cairdcoinheringaahing And I have to go anyway, you have more time to explain it. Nice training session. I'll be back in about ~1 hour or 1 hour and a half. Do you think you'll be around then?
 
3:29 PM
@Mr.Xcoder Yeah, I should be. That reminds me, I have homework to do ಠ_ಠ
 
@cairdcoinheringaahing Me too. That's why I have to go. 2 tests, and a very long Romanian Literature HW. o/ sya
I'll ping when I'm back
 
4:25 PM
@cairdcoinheringaahing can you please send a link to the answer?
 
@cairdcoinheringaahing thanks,
 
Hey look, a +10 just randomly showed up in my achievements ;P
 
Wonder why? looks around
Now I should finish my homework if you don't mind :P
 
@Mr.Xcoder Hmm, same here :P
 
4:29 PM
@cairdcoinheringaahing i have already written 3 whole pages, my fingers hurt
 
@Mr.Xcoder Ooh, that's nasty. Literature homework tends to be the worst IMO
 
I concur.
And after Romanian Literature I have German literature to do... Yupeee
</sarcasm>
 
5:18 PM
@cairdcoinheringaahing I am done with the homework. Are u here too?
 
@Mr.Xcoder Yep,
 
Nice :-)
 
I got kinda annoyed when I saw that this was language specific
 
Hehe :-) Anyway, I am looking for challenges too.
Wait, does my answer qualify for the bonuses?
 
@Mr.Xcoder Yep as it can reach them theoretically
 
5:23 PM
Yupee, 5 byts then
Are you looking at the "[code-golf] [number] sort by: votes" too?
 
There is this but the shortest CJam answer is 377 bytes, so it may not be possible for the both of us :P
 
@cairdcoinheringaahing That's a bit too much
 
@Mr.Xcoder I'm checking number theory
 
5:27 PM
brb
ok, reading it
@cairdcoinheringaahing It already has a Jelly answer at 7 bytes
 
@Mr.Xcoder Link?
Never mind, found it
 
@cairdcoinheringaahing Here.
We can still try it though.
 
@Mr.Xcoder Well, its the exact same as my current solution :P
 
I am solving it too rn
I won't even look at it first.
8 bytes
7 bytes now.
rÆfṪ$ÐṂ
@caird How about ?
 
@Mr.Xcoder s/Ṫ/Ṁ For mine
@Mr.Xcoder Yeah, I'm running out of number theory ones :P
@Mr.Xcoder I'm also looking at posts from 2015 or earlier, as later ones tend to have Jelly answers
 
5:38 PM
@cairdcoinheringaahing Note: If your language contains a built-in for this, then you must NOT use it.
 
@Mr.Xcoder Yep, that's why I chose it :P
 
What about the one I chose?
 
@Mr.Xcoder Reading it now
@Mr.Xcoder I think we should do yours
 
ok, it's definitely not trivial, nor too hard
@cairdcoinheringaahing I have 3 bytes.
 
@Mr.Xcoder 3 bytes
 
5:43 PM
SƤ¡
?
 
Oh ok. Can I post as a CW and mention both methods?
 
@Mr.Xcoder Yeah, sure thing
 
Wait, why can't I make it a CW?
NVM
@cairdcoinheringaahing Posted.
 
@Mr.Xcoder Nice
 
5:49 PM
Now yours or another one ?
 
@Mr.Xcoder I think mine. I've had a go, and the introduction of strings makes it annoyingly difficult :P
5 bytes here
 
working...
I have [20, 'H', 'i', 'H', 'i', 20] :-/
 
@Mr.Xcoder Yeah, I think that's acceptable, given that's how Jelly treats strings
 
IDK I don't think so.
ẎÐL?
 
@Mr.Xcoder is a builtin that does it IMO
 
5:55 PM
@cairdcoinheringaahing Well the Pyth approach uses s with is the exact equivalent of in jelly if it operates on lists.
 
Actually, no, its not a "Flatten list" builtin
So I think that's the shortest
 
It's just flatten by one level :)
Anyway I am definitely not posting this
 
FWIW, mine was ;/ŒḊ¡
 
... or ẎŒḊ¡
or ;/ÐL
 
@Mr.Xcoder Yep, missed those :P
 
@Mr.Xcoder Should be fun. @caird don't look at the Jelly answer
 
@cairdcoinheringaahing 3 bytes here.
huh have I beaten ais?
 
ಠ_ಠ 8 bytes
No hints please :P
 
ಠ_ಠ
After I solved it, I looked at the answer and I literally just removed a character.
so i won't post mine nevertheless.
Oh no mine is wrong, 4 bytes.
 
Does yours use Q?
 
6:07 PM
yes.
@cairdcoinheringaahing You should update your Github profile on SE BTW
Now mine is identical to the existing one :-////
 
@Mr.Xcoder Done
 
@cairdcoinheringaahing Then there's this one.
 
Good.
mine too
 
Hang on for a bit, I'm getting food
 
6:12 PM
sure
me too
Jelly does not have standard deviation ffs
Nevermind I dislike the challenges I linked to.
I got some food too, warn me when you're back
 
6:35 PM
Bacon cooked, at a computer :P
Are we doing the questions you linked?
 
I explain some Jelly to Adam, hold on.
@cairdcoinheringaahing Nope.
(will take a bit of time)
 
How about this when you get back?
 
@cairdcoinheringaahing Will take a look.
 
@cairdcoinheringaahing -1, has a Jelly answer
@Mr.Xcoder Any thoughts?
 
6:53 PM
yeah, i'll take a look in ~2 mins
 
@cairdcoinheringaahing Hahaha, 2 bytes
Nope, that's wrong
 
@caird I now begun solving it. Sorry for the delay!
 
@Mr.Xcoder Nah, no problem :P
@cairdcoinheringaahing 8 bytes
 
12:00 - 19:0019:00 - 21:00

« first day (170 days earlier)      last day (1432 days later) »