« first day (158 days earlier)      last day (2211 days later) » 

2:59 PM
opened tabs
 
opening tabs
Tabs opened :P
 
Ok, I think I have a CMC in mind.
 
@Mr.Xcoder Good, because I can't think of one, and when I can't think of one, I think of insanely difficult ones :P
 
CMC: Given a list of positive integers, return those that are closest to another given integer. (if more are closest, you must output them all)
[3, 4, 5, 7, 7, 8, 7], 6 -> [5, 7, 7, 7]
@cairdcoinheringaahing
 
@Mr.Xcoder Yeah, I'm here. Just annoyed that Jelly doesn't have an inverse version of M
 
3:04 PM
Why'd you need M anyway?
 
> Return all indices of z that correspond to maximal elements.
 
Ik
3 bytes here.
 
ಠ_ಠ I'm overthinking this, aren't I?
 
Yes, you probably are (lol come on)
 
3:06 PM
<---- is very dumb ಠ_ಠ. I fixed mine, and it's still 3 bytes now.
Too many µs :o
@cairdcoinheringaahing Hint Explore the quicks. (another hint: I (ab)used it to outgolf Dennis (barely))
 
Nice
Mine is that too. BTW The thing I fixed is _ -> abs diff (earlier)
@cairdcoinheringaahing Should I think of another CMC or leave it to you? :P
 
I see you had another FGITW challenge :P
@Mr.Xcoder I'll try to think of one
 
@cairdcoinheringaahing Actually I had 2 FGITWs and then 4 consecutive crazy Slowest-gun-in-the-west (posted those after ~12 hours)
 
@Mr.Xcoder Link?
 
3:11 PM
@cairdcoinheringaahing Link to Dennis being barely outgolfed
?
 
@Mr.Xcoder Yeah. I can't find it
 
Here you go:
45
Q: Coprimes up to N

RikerGiven a number n >= 2, output all the positive integers less than n where gcd(n, k) == 1 (with k being any one of the output numbers).  Numbers of this sort are coprime to each other. Example: 10 gives the output [1, 3, 7, 9] (in any form you like, as long as the numbers are unambiguously separa...

Lol, all my badge counts are repdigits: 3, 33, 111 :O
 
CMC: Given a multiplication problem, convert it into the shortest series of additions possible using a number from the original problem. Example: 5 * 2 = 5 + 5 and 9 * 7 = 9 + 9 + 9 + 9 + 9 + 9 + 9
 
brb
@cairdcoinheringaahing nice +1
 
@Mr.Xcoder I'm planning on making a main challenge that is sort of a superset to that
 
3:17 PM
@cairdcoinheringaahing Leaky outgolfed 3 bytes :O
nvm
 
@Mr.Xcoder Yeah, I don't think it's possible to outgolf 3 bytes for that CMC
@cairdcoinheringaahing Input may be taken as a list (5 * 2 => [5, 2])
 
@cairdcoinheringaahing We cannot assume they are sorted, right?
 
@Mr.Xcoder No, sorry
 
ಠ_ಠ Jelly made me copy-paste the character j
 
in The Nineteenth Byte, Sep 26 at 20:26, by caird coinheringaahing
ಠ_ಠ I hate what Jelly has made me do. I just copy pasted the character W
 
3:22 PM
:o
 
Its a common problem :P
 
Did you know that µ can be written from the mac keyboard
 
Ok, I have 6 bytes for my CMC
@Mr.Xcoder Yeah, but I'm on windows at the moment
 
brb chat flags
 
@Mr.Xcoder #10krepproblems :P
 
3:24 PM
The h Bar has tons of flags lately
(Physics chat room)
 
@Mr.Xcoder Do I want to know why it's called The H Bar?
 
@cairdcoinheringaahing Nope you don't
@cairdcoinheringaahing can we output as 9+9+9+9+9+9+9 instead?
 
@Mr.Xcoder Yeah. That's what mine does
 
ṀxṂj”+
 
@Mr.Xcoder Same here :P
 
3:29 PM
CMC: Given a list, repeat each element a number of times equal to each element in the list. Hard to explain, so: [9, 7, 3] -> [[[9, 9, 9, 9, 9, 9, 9, 9, 9], [7, 7, 7, 7, 7, 7, 7, 7, 7], [3, 3, 3, 3, 3, 3, 3, 3, 3]], [[9, 9, 9, 9, 9, 9, 9], [7, 7, 7, 7, 7, 7, 7], [3, 3, 3, 3, 3, 3, 3]], [[9, 9, 9], [7, 7, 7], [3, 3, 3]]]
What do you think?
 
@Mr.Xcoder Looks easy, but isn't as easy as it looks :P
 
ok... EDIT I am done, I will not reveal the byte count yet.
 
@Mr.Xcoder ಠ_ಠ Its easy isn't it?
 
@cairdcoinheringaahing Not really obvious.
The Pyth equivalent would be hell much longer
 
@Mr.Xcoder Does it have to be in that order?
 
3:32 PM
@cairdcoinheringaahing What order do you suggest?
 
@Mr.Xcoder [[[9, 9, 9, 9, 9, 9, 9, 9, 9], [9, 9, 9, 9, 9, 9, 9], [9, 9, 9]], [[7, 7, 7, 7, 7, 7, 7, 7, 7], [7, 7, 7, 7, 7, 7, 7], [7, 7, 7]], [[3, 3, 3, 3, 3, 3, 3, 3, 3], [3, 3, 3, 3, 3, 3, 3], [3, 3, 3]]]
 
Actually, it should be exactly in that order.
@cairdcoinheringaahing From that point, you can just transpose lol
 
ಠ_ಠ I have 4 bytes if I have to output in that order. 2 bytes otherwise
 
2 bytes ordered.
Can I see both?
 
2 bytes: ẋ€ . 4 bytes: ẋ€µZ
 
3:35 PM
Pyth, 7 bytes (mine, if that helps any): mm*]kdQ
 
@Mr.Xcoder :/ I don't know Pyth. That looks like Jelly before I learnt it :P
 
@cairdcoinheringaahing Should I reveal mine or wait?
 
@Mr.Xcoder Go ahead and reveal.
 
 
Ugh, outer product. Well, it has it uses
 
3:37 PM
Now I want a proper, non-built-in, harder CMC
Oh wait.
I have a challenge idea for main... Yay posting! You can post a CMC if you want, I am still available :D
 
@Mr.Xcoder I think I'll have a go at your challenge :P
 
@cairdcoinheringaahing It will take some time to write it.
 
Can you ping me when it's posted?
 
Sure.
And it's not too hard, but not too trivial either
ಠ_ಠ Now I have to make a program for the test cases... Lazy.. bah
 
CMC: Given an array of numbers, find the mean of the mean, median and mode of the list. Example: [1, 2, 1, 3, 1, 2, 3] => [1, 1.8571428571428572, 2] => 1.6190476190476193
I have 9 bytes
 
3:44 PM
10 atm
Æṁ+Æṃ+Æm÷3 will golf
 
Mine isn't too obvious until you get it :P
 
Well does it use the new quicks, like tie or key or smth (dunno what those do yet)
?
 
@Mr.Xcoder No. Tie is alternate between the previous n-links, and I have no idea what key does
 
@cairdcoinheringaahing What is the notation for list literals? [a,b,c] or abc] or what?
 
@Mr.Xcoder [<nilad>,<nilad>] etc.
 
3:48 PM
nilad? Bleh
 
Hmm, it's 6 bytes in Levant. \o/
 
ಠ_ಠ I can't wait to use it too
 
@Mr.Xcoder Well, it'll be a while :( I lost the memory stick with my code on it
 
What is the 9-byter?
 
@Mr.Xcoder You want me to spoil?
 
3:51 PM
@cairdcoinheringaahing ಠ__________ಠ Why would you use a memory stick
@cairdcoinheringaahing whatever, post it
 
@Mr.Xcoder More than one computer
 
@cairdcoinheringaahing Isn't that what GitHub is for?!
 
@Mr.Xcoder Can't run Python from GitHub
 
ಠ__ಠ How did I not see the 9 byter
 
Actually, I'm going to go look for my memory stick (among other things). Should I ping you when I get back?
 
3:54 PM
sure, I am quite busy too rn
 
4:30 PM
@cairdcoinheringaahing Posted.
 
4:50 PM
@Mr.Xcoder Nice. Presumably, you've made it in Jelly?
 
Nope in Pyth
 
Aaand, there's the Jelly answer :P
 
@cairdcoinheringaahing actually 2. Leaky outgolfed erik by 7 bytes
 
@Mr.Xcoder Yeah, just saw. Says something doesn't it? :P
 
Gtg homework
 

« first day (158 days earlier)      last day (2211 days later) »