« first day (138 days earlier)      last day (2231 days later) » 

1:30 PM
If anyone wants to train, ping me. I am kinda free today
 
2:09 PM
@Mr.Xcoder I'm okay to train for an hour max
 
@cairdcoinheringaahing U here now?
 
@Mr.Xcoder Yep.
 
Who thinks of a CMC?
 
@Mr.Xcoder Can you?
 
Ok
CMC: Number of primes smaller than the sum of the prime factors of the sum of a given list.
test case to come
[1,2,3,4,5,6] -> 21 -> [3, 7] -> 10 -> [2, 3, 5, 7] -> 4 (cc @cairdcoinheringaahing)
 
2:16 PM
@Mr.Xcoder Ok, I think I understand. Nice CMC
 
Not really nice. Kinda Chameleonic
But still, ok as a CMC
Oh, and if the sum of the prime factors itself is a prime too, we count it.
Like, 13 would yield [2,3,5,7,11,13]->6
@cairdcoinheringaahing 6 bytes here.
 
@Mr.Xcoder ಠ_ಠ I have 13 bytes
 
@cairdcoinheringaahing Lol wut
Can I see
Maybe you misunderstood
 
I think I over complicated it
 
oh lol soo redundant
@cairdcoinheringaahing Hint: Check out Æf and ÆC.
 
2:23 PM
@Mr.Xcoder Ok, down to 10 bytes
 
Can I see?
(again)
 
@Mr.Xcoder Hang on, golfing a bit
 
okok
Btw, did you catch
6 mins ago, by Mr. Xcoder
Oh, and if the sum of the prime factors itself is a prime too, we count it.
?
 
@Mr.Xcoder Yep, that takes 5 bytes of my code
@Mr.Xcoder Shouldn't that be 7?
 
wut... Did you check out ÆC?
@cairdcoinheringaahing Why?
 
2:26 PM
Ignore me
 
heh
tell me when you're done golfing
that
 
Ok, got 6 bytes. 4 bytes were because I can't count :P
 
yes.
now you should think of a CMC... I don't think it can get any shorter
brb
 
2:30 PM
CMC: Given a number, double it until all digits (0-9) are used (example coming). The output should be the number of times it was been doubled.
 
cool cmc
very, very nice
 
The input may be a float
 
oh. why?
nvm
 
Example: 15070.409912109375 => 13
 
I can imagine a good algorithm, brb searching for appropriate quicks
Mini-CMC #1: Check if all the digits are used in writing a certain a float.
 
2:36 PM
@Mr.Xcoder 5 bytes
 
oh that's short
@cairdcoinheringaahing Does that handle .?
 
@Mr.Xcoder No, I just realised that it doesn't work if the decimal is longer than the integer part
brb, fixing it
 
@cairdcoinheringaahing To the mini-cmc, 9 bytes
oh no, doesn't work
YOU CAN TAKE INPUT AS A STRING
duh caps lock
 
@Mr.Xcoder 12 bytes
Takes input as a number
 
Would you make it shorter by taking a string instead?
 
2:43 PM
@Mr.Xcoder 1 byte shorter
 
@caird 8 bytes, input as a string.
 
@Mr.Xcoder Do you use œ- in yours?
 
@Mr.Xcoder It could be helpful
 
do you think so?
No idea what it does
 
2:46 PM
@Mr.Xcoder Removes items in x that are also in y
 
@cairdcoinheringaahing I use filter for that, 1 byte shorter
Can I see yours?
 
@Mr.Xcoder To be completely correct, it's "multiset difference." (not idea what that is though)
@Mr.Xcoder I would, but its wrong D:
 
ok, try to make it work. Now I think your cmc is a bit too hard for us :D
 
Ok, it works at 13 bytes (input as number)
@Mr.Xcoder Now, I'm going to try my CMC :P
 
@cairdcoinheringaahing Still, can I see yours?
 
2:50 PM
@Mr.Xcoder Ṿṣ”.;/V€µ⁵Ḷœ-. Returns empty list for all used, non-empty otherwise
 
Oh wow that's soo different
How... @cairdcoinheringaahing Why don't you use ØD at all?
oh you generated that by hand >.<
 
@Mr.Xcoder SHould I explain how it works or have you got it?
 
i got it...
 
@Mr.Xcoder Just checking. You seemed confused
 
that's a clever but lengthy approach
 
2:53 PM
@Mr.Xcoder What's yours?
 
But yours will probably be shorter as it works with integers
@cairdcoinheringaahing 8 bytes: ØDḟ³ḟ”.Ṇ
Ok, I have no idea how to recurse in Jelly
 
@Mr.Xcoder ß
 
yeah, no clue how to use it
 
@Mr.Xcoder <link>ß
 
@cairdcoinheringaahing ಠ_ಠ
 
2:58 PM
@Mr.Xcoder Like this
 
Yeah, I get segfault
 
@Mr.Xcoder There needs to be some sort of conditional, to prevent max recursion error
 
@cairdcoinheringaahing lol
 
@Mr.Xcoder Every number until segfault :P
 
@cairdcoinheringaahing lol
that's too hard for me
 
3:03 PM
Right, I'm going to make my CMC slightly easier. CMC: Double until all numbers are used at least once. The final number is the output
@Mr.Xcoder How is that even syntaxically valid?
 
@cairdcoinheringaahing no idea
Why is main soooooooo inactive today, any idea?
 
@Mr.Xcoder Just one of those days I guess
@cairdcoinheringaahing 16 bytes
 
I am too tired rn to solve that. I just waana see yours now
@Mr.Xcoder 0/10 bad, bad English
 
@Mr.Xcoder Hold on, I'm checking to see if I can make it work for the first version of the CMC
 
I have another CMC (if you didn't already solve it)
 
3:14 PM
@Mr.Xcoder You can post it if you want, but I may not answer it right now
 
CMC: Multiplication table up to n
5 yields this exact result:
 
@Mr.Xcoder 4 bytes
 
 1  2  3  4  5
 2  4  6  8 10
 3  6  9 12 15
 4  8 12 16 20
 5 10 15 20 25
Formatted like that ^
@cairdcoinheringaahing yes
2 4-byters, in fact
 
@Mr.Xcoder ×€RG
 
That's my first one
My second one is ×þRG (and Erik's, mostly)
 
3:19 PM
YES! For the first CMC, I have 21 bytes.
Try it online! if you want to take a go at golfing it :P
 
Hooray
@cairdcoinheringaahing 20 bytes
 
@Mr.Xcoder do you think I should post that as a main challenge? 20 bytes for Jelly shows its not trivial
 
Mhm, maybe
@cairdcoinheringaahing Please, you'd still be outgolfed by someone
 
@Mr.Xcoder I'm glad to see you have confidence in my golfing skills :P
 
@cairdcoinheringaahing You have done an amazing job, but TBH Jonathan / Erik would shave off a couple of bytes
@cairdcoinheringaahing I think it's good for main, yeah
 
3:24 PM
@Mr.Xcoder Just checking, you're not just saying that because you want something on main, right? :P
 
@cairdcoinheringaahing No, I said that because you asked me a question.
That doesn't mean I wouldn't solve it, though.
 
@Mr.Xcoder Ok, just checking :P (was mainly joking)
 
:DD:
 
Hang on, I've got to go, can't post it now. Damn CV o/
 
@cairdcoinheringaahing CV?
\o
Curriculum Vitae...?
 
3:26 PM
@Mr.Xcoder A piece of paper that tells employers about you
 
@cairdcoinheringaahing ^^
 
@Mr.Xcoder Yep
 
Ok, do your thing
@cairdcoinheringaahing For when you come back, your very first test case should've been 2 instead of 13, and your program agrees.
@cairdcoinheringaahing Also for when you come back, 11 should yield 39 instead. 11*2^39 has unique digits, whilst 11*2^40 lacks an 8.
 

« first day (138 days earlier)      last day (2231 days later) »