« first day (176 days earlier)      last day (2193 days later) » 

5:22 PM
Hi! opens tabs
 
\o
@cairdcoinheringaahing Old challenges or cmcs?
 
I'd say CMCs, but I'm going to go eat in the next 10 minutes, so a small one
 
Ok, can you please think of one?
 
CMC: Given n, determine the smallest number that is divisible by n which is greater than n
 
5:25 PM
1 byte.
 
1 byte
lol
 
Still 1 byte? :P
 
No, better now
 
1 byte though
 
5:26 PM
but another byte
 
NVM, 2 bytes
 
NVM
 
no it's 1 byte
 
1 byte here.
 
5:27 PM
@cairdcoinheringaahing Only positive
?
 
Yes, just so my answer is still valid :P
 
?
 
Yeah, that was mine
 
Ok, let's make it handle any integer, ok?
 
5:28 PM
CMC: Given x and y, determine the largest integer divisible by x that is less than y. x and y can be any number that isn't 0
 
CMC: Given any integer n (negative or positive), determine the smallest number that is divisible by n which is greater than n
 
@Mr.Xcoder It's can't be 0
 
@cairdcoinheringaahing Huh?
 
@cairdcoinheringaahing 1 byte for positive >1
@Mr.Xcoder nothing is divisible by 0
 
Fixed.
 
5:31 PM
@EriktheOutgolfer That can't be a builtin
 
you edited
 
@cairdcoinheringaahing Guaranteed that such a number exists?
 
@Mr.Xcoder Yes
y is guaranteed to be greater than x
 
then 5 bytes...?
 
and for my CMC I wonder what is the lowest byte count...
I currently have 7 bytes....
 
5:36 PM
and I have 1 byte
(I can do spoiler as well)
 
@EriktheOutgolfer For mine?
 
I don't believe you, sorry
:P
Mine is ‘ọ³$1#
 
31 secs ago, by Erik the Outgolfer
(I can do spoiler as well)
 
Actually 4 bytes: ‘ọ1#
@EriktheOutgolfer Spoiler then please.
 
5:38 PM
oh wait a sec
oh it's not apparently
 
It doesn't work for negatives does it?
@EriktheOutgolfer Of course not... -3 * 2 = -6, -6 < -3
 
for -10 I suppose I must return 10 right?
 
@EriktheOutgolfer for Xcoder's latest challenge, I'm annoyed that you didn't copy paste the code/explanation all in one :P
 
@EriktheOutgolfer No.
 
then what?
 
0 obviously
 
then 4 bytes
 
@EriktheOutgolfer Can I add an explanation to your Husk answer?
 
(not same as yours)
@Mr.Xcoder I'll add it
 
Ok then
 
5:40 PM
@EriktheOutgolfer Can I have a guess at your code?
 
Nevermind, just realised that my guess wouldn't work
 
Although Ḥ0<1$? should work, right?
 
huh no
what does <1$ even do
 
5:42 PM
@EriktheOutgolfer Check whether it's less than 1
 
so if it's less than 1 double?
 
Isn't it <else><if><cond>? or am I getting it the wrong way round?
 
You probably have this 4-byter @EriktheOutgolfer?
 
@cairdcoinheringaahing definitely the latter
@Mr.Xcoder had that before, now I have a 3-byter
 
@EriktheOutgolfer 3 bytes?
 
5:49 PM
valid too, but not mine
Ḥ»0
 
Nice.
 
6:39 PM
@Mr.Xcoder you still here?
 
Yes.
 
I have an old challenge, wanna try this?
 
I'd like to solve old challenges, so yeah lemme read it.
Shoot I have this:
1
1 2 1
1 2 3 2 1
1 2 3 4 3 2 1
1 2 3 4 5 4 3 2 1
1 2 3 4 5 6 5 4 3 2 1
1 2 3 4 5 6 7 6 5 4 3 2 1
1 2 3 4 5 6 7 8 7 6 5 4 3 2 1
1 2 3 4 5 6 7 8 9 8 7 6 5 4 3 2 1
And now this:
1
1 2 1
1 2 3 2 1
1 2 3 4 3 2 1
1 2 3 4 5 4 3 2 1
1 2 3 4 5 6 5 4 3 2 1
1 2 3 4 5 6 7 6 5 4 3 2 1
1 2 3 4 5 6 7 8 7 6 5 4 3 2 1
1 2 3 4 5 6 7 8 9 8 7 6 5 4 3 2 1
1 2 3 4 5 6 7 8 7 6 5 4 3 2 1
1 2 3 4 5 6 7 6 5 4 3 2 1
1 2 3 4 5 6 5 4 3 2 1
1 2 3 4 5 4 3 2 1
1 2 3 4 3 2 1
1 2 3 2 1
1 2 1
1
 
        123456789
       123456789
      123456789
     123456789
    123456789
   123456789
  123456789
 123456789
123456789
 123456789
  123456789
   123456789
    123456789
     123456789
      123456789
       123456789
        123456789
 
How long did it take you to generate that ^?
 
6:47 PM
From when I proposed the challenge to now
 
@cairdcoinheringaahing In bytes, not in seconds...
 
8 bytes here for:
1
121
12321
1234321
123454321
12345654321
1234567654321
123456787654321
12345678987654321
123456787654321
1234567654321
12345654321
123454321
1234321
12321
121
1
 
How about this one:
        12345678
       1234567
      123456
     12345
    1234
   123
  12
 1

 1
  12
   123
    1234
     12345
      123456
       1234567
        12345678
 
Lol
 
6:50 PM
So close:
        89
       789
      6789
     56789
    456789
   3456789
  23456789
 123456789
9
 123456789
  23456789
   3456789
    456789
     56789
      6789
       789
        89
 
Pff...
11111111111111111
 222222222222222
 133333333333331
  2444444444442
  1355555555531
   24666666642
   13577777531
    246888642
    135797531
     2468642
     1357531
      24642
      13531
       242
       131
        2
        1
 
12121212121212121
123434343434343
123456565656521
1234567878743
1234567896521
12345678743
12345676521
123456743
123456521
1234543
1234521
12343
12321
123
121
1
1
TBH I have no idea how to center that
@cairdcoinheringaahing We are clearly doing something wrong
 
ಠ_ಠ I have:
        9
       898
      78987
     6789876
    567898765
   45678987654
  3456789876543
 234567898765432
12345678987654321
 234567898765432
  3456789876543
   45678987654
    567898765
     6789876
      78987
       898
        9
And now:
12345678987654321
 234567898765432
  3456789876543
   45678987654
    567898765
     6789876
      78987
       898
        9
       898
      78987
     6789876
    567898765
   45678987654
  3456789876543
 234567898765432
12345678987654321
 
It should be easy... Since I generate the list needed in 7 bytes...
But of course grid doesn't do what we want ffs
 
6:59 PM
\o/ 26 bytes
 
I know how to generate the spaces and the array, but I don't know how to concatenate them
ಠ_ಠ
How do you join with an empty string in jelly?
NVM
 
ಠ_ಠ Why doesn't Jelly have a center command?
 
IDK...
 1
  121
   12321
    1234321
     123454321
      12345654321
       1234567654321
        123456787654321
12345678987654321
 123456787654321
  1234567654321
   12345654321
    123454321
     1234321
      12321
       121
        1
 
So close :P
Ugh, mine beats CJam by 1 byte. That's clearly not enough
25 bytes
 
I am struggling to make mine shorter, it's horrific.
 
7:09 PM
How long is yours?
 
I am too embarrassed to reveal.
Listing is 7 bytes, spacing is >>> 25
 
What do you mean by "listing"?
 
@cairdcoinheringaahing Generating [1, [1,2,1], [1,2,3,2,1], ..., [1, 2, 1], 1]
I have a feeling our approaches combined would be shorter...
 
I managed to get this:
        1
       121
      12321
     1234321
    123454321
   12345654321
  1234567654321
 123456787654321
1
 123456787654321
  1234567654321
   12345654321
    123454321
     1234321
      12321
       121
        1
@Mr.Xcoder Should we reveal, then golf them both?
 
Wait.
ARGHHH Jelly why can't 9NR be [-9, -8,... ] instead of []!!!
 
7:13 PM
Because that's 9RUN
 
\o/ 26 bytes (cc @cairdcoinheringaahing)
 
You have 25?
 
Let's reveal and see what we can golf further.
 
Mine is Spoiler. I already have ideas
24 bytes.
 
@cairdcoinheringaahing 24 bytes spoiler
 
7:25 PM
All the repeated ŒḄ feel wasted
 
Well:
ŒḄ
9RÇƤÇḌµ9ḶUNÇA⁶ẋ,µZY
(22)
 
Yeah, I know :(
 
Is Probing Output Cache... a new thingy on TiO?
 
@Mr.Xcoder No idea
 
What's that r0?
Oh nvm
21 bytes here too now...
@cairdcoinheringaahing Don't you think ,µZY is very wasteful? It is basically pair-zip-join, can't we just map-concatenate-join?
 
7:32 PM
@Mr.Xcoder Yeah, but I can't seem to make it work :(
 
Nor do I....
 
Also, I think that your latest challenge is the longest a challenge has gone without a Jelly answer this year :P
 
You can answer if you want to
@cairdcoinheringaahing Let's post as a CW and we'll see?
I think I gtg soon
 
@Mr.Xcoder For the diamond one?
 
yes of course
 
7:35 PM
Should I post (as CW), or do you want to?
 
I will, I have it copied already
But we should be able to get ~18 bytes sometime in the future...
 
@Mr.Xcoder If you mean for your alternested challenge, I think everyone (Jellyers) are waiting for Leaky to post his from the Hackathon
@Mr.Xcoder How so?
 
@cairdcoinheringaahing Our code seems redundant, maybe future ideas will improve it.
@cairdcoinheringaahing Erik outgolfed him by 3 bytes.
 
@Mr.Xcoder Oh, nice one Erik :P
(don't really want to ping him :P)
ಠ_ಠ I can't believe that J beats Jelly
 
@cairdcoinheringaahing J doesn't beat Jelly, the thing is that we are terrible at Jelly.
 
7:40 PM
:P
I wouldn't say terrible, just that we aren't the best :P
 
s/aren't the best/among the worst/
:P
 
Whatever floats your boat :P I still say you're better than me though
 
@cairdcoinheringaahing I still think you are wrong.
(and I am really, really not being polite BTW).
 
@Mr.Xcoder Same here. How about we say we're just as good as each other? :P
 
Agreed.
@cairdcoinheringaahing Posted. BTW I just got 20 bytes.
 
7:45 PM
What's the 20 byte solution?
Huh. Why did someone downvote?
 
Misclick.
(prolly)
@cairdcoinheringaahing It's in the answer now.
 
@Mr.Xcoder Nice. You up for another question?
 
At least J doesn't beat us anymore
 
@cairdcoinheringaahing I would like to, but my parents already sleep and told me to do so as well. Give me some time to go to my bed and prepare for fake sleep and then we'll try another one?
(ping you when I'm back)
 
7:48 PM
@Mr.Xcoder Sure. I'll look for some good ones
Are there any tags we are never going to go for?
 
@cairdcoinheringaahing Dunno
 
@cairdcoinheringaahing I'm back. Note that i will try to shorten my messages as much as possible to avoid many clicks.
@cairdcoinheringaahing yes, avoid those
I have some crazy golfing ideas for the diamond one, waitt.....
 
Seems appropriate, given we're golfing :P
 
@cairdcoinheringaahing you should try ^^ too
 
7:58 PM
@Mr.Xcoder What, golfing the diamond one?
 
Yes.
 
No idea what ideas you have, and I can't think of any improvements. I'm narrowing down a default search field for questions though :P
 
@cairdcoinheringaahing Why does 9RŒḄƤµr0⁶ẋ,µZ run, while adding doesn't (9RŒḄƤḌµr0⁶ẋ,µZ)?
 
@Mr.Xcoder No idea :P
 
@cairdcoinheringaahing 18 bytes: 9RŒḄƤḌµ8r0⁶ẋ,µZŒḄY (MWAHAA exactly 18 bytes)
 
8:07 PM
Nice
 
@cairdcoinheringaahing Could you look for challenges while I edit?
@cairdcoinheringaahing Edited.
What tag are you looking for?
U still here? ;-;
Oh hello @LeakyNun
 
hi
 
@LeakyNun Do you see immediate golfing techniques here (print this diamond challenge)?
We have 9RŒḄƤḌµ8r0⁶ẋ,µZŒḄY, which seems horrifically redundant
 
don't forget to mark your answer non-competing! :-)
[and delete your input]
 
@LeakyNun Is that a thing?
 
8:18 PM
@Mr.Xcoder it is, since the challenge was created before Jelly
 
Ok then... Anyway
@LeakyNun Fixed.
Oh I have some ideas now...
 
I have a 12-byter
 
@LeakyNun How long does it take you to generate the list of values?
(in bytes)
 
it's hard to count that way
 
ok then.
 
8:21 PM
I can say 7
counting in a weird way
 
Padding with space is a headache
 
that's 2 bytes for me :P
 
ಠ_ಠ
 
you might want to read the comment later
 
@LeakyNun Which?
 
8:23 PM
the one I just posted
 
Oh.
Let me understand that first.
@_@ RRU
 
@Mr.Xcoder No, my parents sent me to bed :o
 
@LeakyNun using yours, I got 12 too: 9Rr1z⁶ṚŒBŒḄY. Thanks a loooot!
 
nice
 
@LeakyNun Edited.
 
8:32 PM
now you have an extra header :P
 
fixed
 
lol
 
ಠ_ಠ
@LeakyNun I will try to get 11 without looking at your spoiler first.
@LeakyNun Yupee I got 11 but it's nearly identical now that I look at yours: 9ŒḄr1z⁶ṚŒḄY
 
nice
 
@LeakyNun Non-competing no longer exists for newer languages
 
8:42 PM
@cairdcoinheringaahing This one is blatantly non-competing though
 
@Mr.Xcoder Yeah, but non-competing does not exists anymore, unless the author says that challenges must be marked so.
 
@cairdcoinheringaahing The challenge predates the consensus.
 

« first day (176 days earlier)      last day (2193 days later) »