« first day (2694 days earlier)      last day (2444 days later) » 

18:00
@Cowsquack (sorry, I'm new to CMCs) Can I assume the inputs contains only printable characters?
"You can choose the repeating char"
ah, ok then
@Zacharý yeah i guess the java devs really care about golfing
@Cowsquack QuadR, 12 bytes Try it online!
@DJMcMayhem I have 10
18:08
My python answer was golfed from 45, to 44, to 38
@Cowsquack Challenge accepted, don't let me see it yet
@Adám how does 1↓⍬ work?
@Cowsquack SOGL, 5 bytes. 1st 2 bytes could be removed if 0 was an invalid input
@Cowsquack Jelly, 3 bytes. Hehe :P
@DJMcMayhem Does the 38 byter work for the empty string test case?
No :|
Although I just fixed it for +0
@Cowsquack F#: function|'-'::t-> -t.Length|s->s.Length
Takes a char list
18:17
@Mr.Xcoder Do you have a python solution?
@Cowsquack @DJMcMayhem I have 9 bytes pure Vim
@flawr @betseg I approve of this post
also, checkout r/calligraphy
Oh no, It doesn't quite work
@DJMcMayhem Of course I do. Currently it's 39 bytes so well done :)
Does yours take input as a string?
18:21
I would have 38 if handling "" wouldn't have been necessary.
I also have a 26 byte brain-flak answer :)
@Cowsquack I give up
I'm out-vimmed today
@DJMcMayhem What's the challenge?
27 mins ago, by Cows quack
CMC: Given a string that is the unary representation of an integer (negative integers have a - at the start), return the number it represents. You can choose the repeating char ##### => 5, -111 => -3, !!!!!!!!!! => 10, <empty string> => 0
Why not ([]<>)?
My answer is sorta cheeky, though I believe it's valid.
@CatWizard Negatives
18:23
@Cowsquack JS, 25: (a,l=a.length)=>a<0?1-l:l
24 now
Now I have 10 bytes pure vim.
@Cowsquack If input is nothing, gives . If input is ⍬⍬⍬ gives 1↓⍬⍬⍬⍬.
@DJMcMayhem 32
@CatWizard Tip: I used 0x00 as the repeating character (which doesn't work on TIO, so on TIO I used char codes)
18:28
Ah yes cheeky
But not invalid ;)
That's pretty similar to mine
@DJMcMayhem Your's is 24?
Yep: {{}([[][]]<>)<>}([]<>{})
Your's is nicer though
18:32
@CatWizard 20 now
Ah dang
Oh clever!
That's beautiful. I had <{}>[[][]()] but that's a nice trick how [[]<{}>[]] is equivalent
I don't think the 18 can be beat
@CatWizard That's a really elegant solution
Thanks.
Hmm, my vim answer didn't work for 2 digit numbers. Here it is now 11 bytes
Uhh, my answer works for everything but 0
18:36
@Riker hehe:)
@Mr.Xcoder Counted wrong, I'm actually at 36. Do you want me to reveal?
@DJMcMayhem Another 18 this one is a bit easier to understand.
Man, brain-flak competitions are fun.
@DJMcMayhem Yes, you can reveal. I am eating now so I'll get back to trying to outgolf you later :P your solution later
Sometimes, I think I enjoy CMCs more than the main site
18:39
^
@DJMcMayhem Yeah, especially on relatively simple competitions
@Mr.Xcoder Python 3, 36 bytes: lambda s:[len(s),-len(s)+1]['-'in s]
@DJMcMayhem 1-len(s)? :p
Oh doi
I always miss those stupidly obvious things
If anyone understands Pepe, I've got this, but it doesn't work for 0... :/
18:40
~len(s)?
@Cowsquack Retina 0.8.2, 9 bytes
That gives negative 5 for -111
too many pings :P
I'm pretty impressed that Brain-Flak is beating most of the high level languages.
18:42
OK, semi-related CMC: print the first N terms of the following sequence: 1, -1, 11, -11, 111, -111, 1111...
Actually, scratch 0
@DJMcMayhem God I was close... I had lambda s:s.count("1")*(-1)**(s[:1]<"1")
@Adám oh, so ⍎⍵ is pre-processing?
now to crack the pure vim solution
@DJMcMayhem Canvas, 9 bytes
18:48
@Mr.Xcoder The end could be '-'in s for -2
I know after seeing yours.
@Adám nice one :)
@DJMcMayhem PowerShell, 50 bytes -- Try it online!
I don't know how I made it, but I guess I lost a lot of bytes.
@Cowsquack Did you see that mine was 11 bytes in the end
18:55
yeah
Something is wrong with the link, wait
It's quite similar to what iI did here
@Cowsquack sed -r, 69 66 bytes, Try it online!
Looks like my submission doesn't work online (it does offline), for some reason. Pepe, 86 bytes anyway
@H.PWiz do you think you can beat my V answer?
19:00
It didn't work because I haven't pushed my last commit, dammit. Should work in a while
Probably. Let me look at the docs
do you think this challenge (along with the reverse challenge) would be good on main?
yes
I feel ambivolent but not apathetic.
I'm anyways thinking of posting it in anagol sometime (as a limited-time challenge) to get to see the shortest sed unary<=>decimal solutions
19:12
@Cowsquack No, post-processing.
ah, that makes sense
@DJMcMayhem RAD, 22 bytes (with RAD_IO being set to 0) (≢⊢↑⍨'-'=⊃)×1¯1⌷⍨'-'=⊃
Does V have a synonym for @"?
@H.PWiz No unfortunately, although @ at the end of a program/macro/certain ex commands will implicitly fill in to @"
Correction, that should be (≢⊢↓⍨'-'=⊃)×1¯1⌷⍨'-'=⊃
@Adám I assume is implemented either in C/C++, or with a tradfn?
19:24
@Cowsquack I can't come up with any way to shorten it in V
('Hello',⊢),
('Hello' <function deset1.<locals>.<lambda> at 0x7fb9700f3ea0>)
Ugh, now I have to fix the parser again.
1
Q: Finding Fastest Frog's Frolicks

Cat WizardA frog sits on a lily pad wishing it were on the other side of the river. There are some lily pads of varying sizes between the frog and the other side of the river. Larger lily pads allow the frog to jump further than smaller ones and the frog wishes to reach the other side of the river in as ...

@H.PWiz okay I'm spoilering myself now, nice use of the space as the separator, that's where I got stuck
@Cowsquack uh ok aren't you like a rising junior?
that's 2 years of weird name
as somebody who changes his steam name biweekly tha'ts too long per weird name
19:39
Will you try this? @Cowsquack
i.sstatic.net/DpOcp.png 2 were an in-joke with a friend, 1 was 'rikersan' to help somebody friend me easily, 1 was a prototype for another name and only lasted like 5 minutes, the rest are over the last like 4 weeks
> donkey kobg
yeah I'm borrowing from @quartata's twitter
I know see the inspiration for quartatertot's tweets oh wait it's the other way around
@Cowsquack yeah I don't konw where he comes up with this stuff
19:42
@H.PWiz yeah got there
@H.PWiz Why doesn't spoiler work for that?
ZZ at the end
Ah, that's right
like vimgolf
@Riker you might be interested in whatareyoudoinginmyswamp.com (warning sound and video)
@Cowsquack Given I'm currently in public with people behind me, is it safe for me to click on that?
19:50
@H.PWiz Ah, I didn't think that was possible in <12, until I realized the answer is really cheap :P
Actually wait, I can only do it in 11... o_O
> Shrek is Love
that meme died a long time ago. let it stay dead
o/
Hi laser cat
@FreezePhoenix do you just altenrate between blue and yellow avatars?
19:57
@Riker I have a combo one
lol
oh nice
But mostly I alternate (Sorry if it causes any confusion)
np
20:08
@Pavel not really?
@Riker "crawling in my skin" is one of shrek's best
@Cowsquack So? It still died.
but the url is 10/10
So what
Anyone can put a 10/10 rating on their site!
Yes, it is true... anyone can put anything on their site
20:42
Anyone know how to reset local files to version in a remote repository using git?
Uh... are you using git?
Yes ^
Then look it up ;|
@Riker i will make a video detailing my process sometime
but i need to make more fake blood first
20:46
@FreezePhoenix I think I already tried that, but I'll just do it the way I did the last few times: delete the local git folder; then just clone (I just wanted to know if there was a better way to do this)
git reset --hard <branch>
... already deleted it, I'll try using that next time...
wow how many active problems over anagol
20:57
@quartata ok then
@FreezePhoenix can they rate things 5/7 though?
21:19
@EriktheOutgolfer Oh my god! While PPCG is dying (literally), anagol's activity bursts :o
PPCG is dying?
well, most of them are low-quality though
PPCG can't die so easily, it's a graduated site
besides, Mego and others are already preparing Axtell :P
Can an APLer give me a ludicrous train involving ,, +, -, strings, and numbers? I've been having tons of bugs with RAD's train evaluator.
Eugh all are KCs? :c
@H.PWiz There are very very few challenges imho lately
@Mr.Xcoder PPCG has sort-of run out of material to use for challenges
21:23
And pretty much none of them actually atract me much for some reason. I haven't had that golf-enjoyment feeling in a while
Purely looking at the analytics, I'm not convinced
Yeah but if you subtract the closed ones and the low quality ones and you compare their frequency to the last summer...
  taxicabDistance( vector ) {
    vector = Vector.attemptConversion( vector );
    var distance = 0;
    distance += Math.abs(this.X - vector.X);
    distance += Math.abs(this.Y - vector.Y);
    distance += Math.abs(this.Z - vector.Z);
    return distance;
  }
Javascript... is not the best for code golf
22:03
V=>{v=Vector.attemptConversion(V);return Math.abs(this.X-v.X)+Math.abs(this.Y-v.Y)+Math.abs(this.Z-v.Z)}
What is this for?
 
1 hour later…
23:31
@ConorO'Brien do you know if there is a reason TC39 never did a *[Symbol.iterator] for Object.prototype?

« first day (2694 days earlier)      last day (2444 days later) »