The Nineteenth Byte

Leaky Nun

6:00 PM

@EriktheOutgolfer k

Erik the Outgolfer

@H.PWiz in fact I needed it in jelly today I'd have outgolfed matl

like, prepend a 0, exactly what I needed

btw I could add some to my mass pull request :p

Mr. Xcoder

9 bytes in Pyth!?!?! too much

Help pls

orlp

@LeakyNun did you look at my challenge?

Mr. Xcoder

hS.u+YNQ0

Wait

Leaky Nun

@orlp I opened it in a tab but I haven't looked at it

@Mr.Xcoder there is "prefix"

Mr. Xcoder

6:03 PM

@LeakyNun Ik

Erik the Outgolfer

as leaky said .u is an issue

Mr. Xcoder

Wait

Erik the Outgolfer

8 bytes

Mr. Xcoder

My shorter solution did not work

Because I was missing commas in the test cases

ಠ_ಠ

Erik the Outgolfer

also your test cases have some x-y stuff

Mr. Xcoder

6:05 PM

hSsM._+0

@EriktheOutgolfer Because I was missing commas in the test cases

Erik the Outgolfer

mine is hS+0sM._

Leaky Nun

@Mr.Xcoder wtf is 7-3 doing there

@Mr.Xcoder ninja'd heavily

Mr. Xcoder

@LeakyNun Because I was missing commas in the test cases

Lol ninja'd the ninja

Lol I love this one (although it is longer): shosN._+0

o/

Leaky Nun

@Mr.Xcoder C, 62 bytes: i,m,s;f(int*a,int l){for(s=m=i=0;i<l;m=s<m?s:m)s+=a[i++];m=m;}

New Meta Posts

0

Q: Overall Programming Languages scoreboard

It would be nice to have like a score for all programming languages, summarizing all matches. Something like: Score could be anything: won/matches, won/avg, matches/avg, ... It would be nice to be able to sort columns... Hope someone likes the idea! Best regards, Federico.

Leaky Nun

6:13 PM

@orlp I just saw your problem. I gave up within a minute.

(I may try it tonight)

AdmBorkBork

@Mr.Xcoder PowerShell, 38 bytes -- $l=0;(,0+$args[0]|%{($l+=$_)}|sort)[0]

Leaky Nun

it's basically how GPS works

sans the relativity part

orlp

@LeakyNun you did?

it's actually pretty easy

Leaky Nun

yes but I don't have time now

orlp

in fact this challenge is the runner up to a vastly more difficult problem I'm actually stuck on

Leaky Nun

6:14 PM

it's 19:14 now and I still have a million things to do

@orlp what is the probem?

orlp

I'm going to post the next one as a code-challenge optimization problem

@LeakyNun it's the same problem, except this time you get all the distances rounded down to the nearest multiple of 5

Leaky Nun

@orlp wat da hell

orlp

basically

if the distance matrix says 5

it means the real distance is between 5 and 10

now the challenge is to find the algorithm that can best approximate the points

@LeakyNun essentially introducing uncertainty

so instead of circle-circle collision resulting in points

you now have anulus-anulus (disk with a hole in it) collision resulting in regions

Leaky Nun

sure

orlp

now THAT is a much harder problem

Leaky Nun

6:18 PM

annulus

orlp

right

but I do believe that with a lot of points you can get quite high accuracy

@LeakyNun the difference between GPS and this is that in GPS you have well-known fixed locations of satellites

Leaky Nun

mone carlo :P

orlp

@LeakyNun that's one approach, but I'd be interested to see what people come up with

AdmBorkBork

Monty Hall

orlp

@LeakyNun but consider for example a network of bots that can send eachother pings and measure response times to get distance measurement, broadcast those measurements to eachother, but have no angular measurement tools, and all bots are always in motion (so no 'anchor' bot)

AdmBorkBork

6:21 PM

Mark each possible point with a goat and add up the number of goats to the number of cars, with cars being the actual points.

orlp

and their distance measurement isn't that precise either

but I strongly believe that their collaborative measurements should add up to something significantly more precise

especially if you add a temporal dimension (measurements over time), but that is a possible challenge #3 or never :P

Neil

@EriktheOutgolfer iirc bitwise and/or predated logical and/or so needed to be lower precedence than the relational operators so that you could and/or their results

Leaky Nun

@orlp that's just another dimension :P

orlp

@LeakyNun only if bots can track how much they moved from their last position

Leaky Nun

I see

Lynn

6:31 PM

sad that the Evil Numbers code is some magical bitwise stuff I could have never come up with

Leaky Nun

@Lynn what is it?

Lynn

n=0;exec'print n;n=n+2^(n^n+2)/2%3;'*400 is 40 bytes

Leaky Nun

@Lynn wtf

that's nice

Lynn

I have no idea how to reason about n^n+2

Pavel

TIL that ISO has a standard for how much solids must be present for tea to be considered tea. I have to wonder what the ISO hasn't standardized.

orlp

6:34 PM

@Lynn it's the bits that change when a number is incremented twice

so the rightmost two bits are always 10

and all the other bits are exactly those bits that got carried

so it's 10, 110, 1110, etc

AdmBorkBork

@Lynn Does Python not have a += operator?

orlp

@AdmBorkBork it wouldn't be shorter

once again someone confused by precedence

Lynn

that’s n=(n+2) XOR (n XOR (n+2))/2%3

AdmBorkBork

Oh, because of the modulo at the end.

orlp

no

you could remove the modulo

here is what you read:

n=n+(2^(n^.....

here's how it actually works:

n=(n+2)^(n^.....

AdmBorkBork

6:38 PM

OK, that seems weird to me

Mr. Xcoder

@LeakyNun 55 bytes: i,m,s;f(int*a,int l){for(;i<l;m=s<m?s:m)s+=a[i++];m=m;}

Leaky Nun

@Mr.Xcoder not reusable

Mr. Xcoder

In case you didn't know, variables declared globally are assigned to 0

@LeakyNun I don't mind

Leaky Nun

@Mr.Xcoder it's PPCG rule

Mr. Xcoder

:P

Ik

Poke

6:40 PM

@AdmBorkBork bitwise operators have low precedence

AdmBorkBork

OHHHH, it's XOR not exponent

Right

durr

Mr. Xcoder

CMC: Given an array of integers, return the difference between the maximum element and the minimum element.

[1,3,4,6,-6] -> 12

Erik the Outgolfer

leaky's so gonna hate this...

Leaky Nun

@EriktheOutgolfer but i'll defend to the death his right to use floats :P

Erik the Outgolfer

:p

Mr. Xcoder

6:41 PM

Uh oh why?

Erik the Outgolfer

@LeakyNun but he's the asker ;p

although he does have the right to answer

Mr. Xcoder

@LeakyNun or integers, if you prefer - Perfect for ya :D

Edited.

Erik the Outgolfer

jelly, 5 bytes (untested): Ṣ.ị_/

or negative for 4 bytes: Ṣ.ịI

(latter is full program)

Mr. Xcoder

Pyth, 6 (?): -eSQhS

Nice Erik

AdmBorkBork

@Mr.Xcoder PowerShell, 28 bytes -- ($a=$args[0]|sort)[-1]-$a[0]

Works for either float or integer or a combination

Mr. Xcoder

6:43 PM

ooh nice, powershell is kinda competitive (for practical languages)

Erik the Outgolfer

or 3 bytes: Ṁ_Ṃ :p

Mr. Xcoder

Ṁ_Ṃ ≈ inverse palindrome Ṁ_Ṃ

orlp

Python 2: def f(l):l.sort();print l[-1]-l[0]

Erik the Outgolfer

rotate 180 degrees: Ẇ_Ẉ

Mr. Xcoder

Uh god Jelly why

Erik the Outgolfer

6:44 PM

(Ẉ might soon be z - 2 btw)

Leaky Nun

@orlp lambda a:a.sort()and l[-1]-l[0]

orlp

@LeakyNun shouldn't that be or?

Mr. Xcoder

Also 34: l=sorted(input());print l[-1]-l[0]

Leaky Nun

@orlp right

orlp

either way it returns False if the difference is zero

not sure if that's allowed

Leaky Nun

6:46 PM

@orlp really?

Mr. Xcoder

@LeakyNun Yes

Leaky Nun

why?

orlp

because if both arguments to or are falsey it will return False, no?

Mr. Xcoder

Because 0 is falsy...

orlp

no it won't

never mind

Mr. Xcoder

6:47 PM

@orlp @LeakyNun It returns None instead actually

DJMcMayhem

@Mr.Xcoder Can we assume that the input does not contain any 0's?

AdmBorkBork

@Mr.Xcoder PowerShell usually trades blows with Python and JavaScript, unless the challenge is math-heavy or involves string reversals.

orlp

@Mr.Xcoder that because he uses and instead of or

it should be or

Mr. Xcoder

@DJMcMayhem Yes, you may.

DJMcMayhem

Sweet

Mr. Xcoder

6:47 PM

Oh right

J. Salle

@Mr.Xcoder I got 3 bytes in Jelly Ṁ_Ṃ

Erik the Outgolfer

umm, why that assumption???

Mr. Xcoder

@J.Salle Ninja'd badly

3 mins ago, by Erik the Outgolfer

or 3 bytes: Ṁ_Ṃ :p

Leaky Nun

@orlp no?

Mr. Xcoder

@J.Salle Well done anyway!

J. Salle

6:47 PM

@Mr.Xcoder I wasn't looking at chat >.>

orlp

@LeakyNun no I was wrong about that

Pavel

I'm doing a regex puzzle and the challenge is to match words that have fu on the end, $ not allowed. I've been stuck for a while and it's supposedly a really simple challenge, can anyone tell me what I'm missing >_>

Erik the Outgolfer

where?

orlp

@Pavel impossible to answer without the exact dialect and rules used

DJMcMayhem

@Mr.Xcoder Brain-flak, 208 bytes:

([]){({}[()]<(([])<{({}[()]<([([({}<(({})<>)<>>)<><({}<>)>]{}<(())>)](<>)){({}‌())<>}{}({}<><{}{}>){{}<>(<({}<({}<>)<>>)<>({}<>)>)}{}({}<>)<>>)}{}<>{}>[()]){({}‌[()]<({}<>)<>>)}{}<>>)}{}([{}]<{({}<>)<>}><>{}<>)

Mr. Xcoder

6:49 PM

Anyway @LeakyNun WTH:

> lambda a:a.sort()or l[-1]-l[0]

Pavel

@orlp JavaScript

Erik the Outgolfer

@DJMcMayhem oh so that's what the assumption is for

DJMcMayhem

Yep

Mr. Xcoder

Like, a.sort() and then l[-1]??!?

orlp

@Mr.Xcoder you sure about l and a there?

Erik the Outgolfer

6:50 PM

although I think you could use [] for "stack length"

AdmBorkBork

@Pavel Lazy matches instead of greedy matches?

orlp

oh wait was that in leaky's original? :D

yes it was haha

DJMcMayhem

@EriktheOutgolfer I can, it's just longer

Pavel

I tried (?!=.) instead of $ but it didn't work.

Leaky Nun

@orlp I'm stupid

6

Erik the Outgolfer

6:50 PM

@Pavel what site is the puzzle on

Pavel

@EriktheOutgolfer alf.nu/RegexGolf

If you complete the puzzle "warmup" the challenge "It never ends" unlocks, which is what I'm stuck on.

DJMcMayhem

@Pavel I don't know what flavor you're using, but fu.\@! works in vim-regex

Mr. Xcoder

Why does one... Star a... Message with Leaky being self-criticist/critical?!? (I am not sure if the last word is a thing lol)

DJMcMayhem

Or fu\n I guess

Erik the Outgolfer

@Pavel fu\b

Pavel

6:51 PM

:O TY

Erik the Outgolfer

@DJMcMayhem nope

DJMcMayhem

Why not?

Erik the Outgolfer

why should there be a trailing newline at the end?

DJMcMayhem

Oh wait a second, words that have fu at then end, not lines

Mr. Xcoder

@DJMcMayhem Lol sorting is not Brain-Flak's forte

>_>

DJMcMayhem

6:53 PM

Most definitely not

Erik the Outgolfer

@DJMcMayhem even if it were lines you can't assume the line you're testing isn't the last one where no trailing \n is present

DJMcMayhem

The comparing the first and last elements is only 24 bytes, the rest is the sorting

Erik the Outgolfer

@DJMcMayhem deep stack = brain-flak sucks a lot :p

DJMcMayhem

Deep stack?

Erik the Outgolfer

like, the whole stack, not just the top element

DJMcMayhem

6:54 PM

Oh

Yeah, usually

Giuseppe

@Mr.Xcoder R, 24 bytes: cat(diff(range(scan())))

DJMcMayhem

Not always. It can do stuff like increments

It's really comparisons that it's terrible at

Mr. Xcoder

PLS halp 5 bytes: -▼⁰▲⁰ (husk). I am sure it should be 4 (or even 3)

Erik the Outgolfer

@Mr.Xcoder §

DJMcMayhem

That's a funny face

Mr. Xcoder

6:55 PM

@EriktheOutgolfer Yep just about to use it too

Erik the Outgolfer

(yay this time didn't forget it :D)

AdmBorkBork

@DJMcMayhem I can't tell if it's looking at the upside-down triangle, or if it's looking away and that's its ear.

Leaky Nun

2

A: Primitive roots density of number

Python 3 Why am I using Python for fastest-code >_> 8.89 sec for 1,000,000. def f(a,b): primes = [True]*(a+1) primes[0] = primes[1] = False for p in range(2,a+1): if primes[p]: for j in range(p**2,a+1,p): primes[j] = False primes = [i for i in range(2,a+1) if primes[i]] count = 0

any advice?

Erik the Outgolfer

don't use python :p

J. Salle

@AdmBorkBork looks like the face is looking at an upside down triangle moving towards it

HyperNeutrino

6:57 PM

CMC: Given a list of at least 3 integers, all unique, return the largest number in that list that is the GCD of two of other integers in the list. Example: 2, 3, 4, 7, 8, 10 -> 2. You may assume that at least one integer in the list will be the GCD of two other integers. Other example: 4, 8, 13, 1, 14, 2, 3, 15, 12 -> 3

DJMcMayhem

If someone did that in brain-flak, I would cry

Erik the Outgolfer

@DJMcMayhem then comes funky computer man

Leaky Nun

@DJMcMayhem did what?

DJMcMayhem

HN's CMC

Leaky Nun

no :P

DJMcMayhem

6:59 PM

And by HN, I mean HyperNeutrino, not Hacker News

HyperNeutrino

:P

Erik the Outgolfer

of course you don't mean that big off-topic question source :p

HyperNeutrino

what if I am Hacker News

Mr. Xcoder

@Erik §-▼▲

Erik the Outgolfer

yep

AdmBorkBork

7:02 PM

@HyperNeutrino That's gonna be pushing 200 bytes in PowerShell.

Not very mini

DJMcMayhem

@EriktheOutgolfer Vim always matches \n at the end of a line: tio.run/##K/v///COw@v@/08sTkkDAA

Mr. Xcoder

@HyperNeutrino Can you explain your second test case?

I don't think it is correct.

Erik the Outgolfer

@DJMcMayhem because it's one of the editors which automatically include a trailing newline if it's not already there?

Giuseppe

3 is the gcd of 15 and 12

HyperNeutrino

what do you think the answer should be then?

@Giuseppe uh yes

Mr. Xcoder

7:03 PM

Oh nvm

Erik the Outgolfer

@Giuseppe ~~no it's 8~~

hi @Giuseppe

Sorry, my mistake

nice to see you here

What do you do if you want to reopen your old question? I edited it to put it in the review queue and it got another reopen vote, but it's still closed.

HyperNeutrino

7:03 PM

link it here :P

Challenger5

(It's this)

Giuseppe

@LeakyNun hello! I've been popping in recently

Challenger5

Just got another reopen vote...

AdmBorkBork

@Challenger5 You can flag it for moderator attention.

Leaky Nun

it's 20:04 and I have procrastinated for too long

HyperNeutrino

7:04 PM

I have 22 bytes in Jelly for my CMC

Leaky Nun

time to leave

Erik the Outgolfer

@Challenger5 you can also do nothing ;p

Challenger5

@AdmBorkBork If it doesn't get enough reopen votes right now, I'll flag it

Poke

@Pavel you finish Abba yet

Erik the Outgolfer

your edit will bump to the front page

DJMcMayhem

7:05 PM

@HyperNeutrino If the Jelly solution is more than a dozen bytes, you know that it'll be a pain in any other language

Erik the Outgolfer

(not that it's used by everybody around)

HyperNeutrino

@DJMcMayhem yup :P

or perhaps I'm bad at Jelly and thus got 22 bytes but really you can get fewer :P

Challenger5

@EriktheOutgolfer I'm not going to edit it unless I see something to edit.

Which atm I don't

Erik the Outgolfer

you said you edited it before

that will not only put it in review queue but also on the front page so it gets even more (although admittedly not really that much :p) attention

Mr. Xcoder

@HyperNeutrino Pyth, 17 bytes: eS@iMfqT-TiFT.cQ2

HyperNeutrino

7:07 PM

ooh nice

> 102 views

Erik the Outgolfer

@HyperNeutrino by "other" do you mean the maximum integer itself can't be one of the gcd function's arguments?

HyperNeutrino

yes

Challenger5

I've edited it, but at this point it's out of the front page and review queues. I am not going to edit it just to put it back.

Mr. Xcoder

NVM it is wrong

shoot

Erik the Outgolfer

@HyperNeutrino that's most probably what makes it difficult

HyperNeutrino

7:08 PM

so you must find maximum a in a, b, c such that a = gcd(b, c)

@EriktheOutgolfer yes

Leaky Nun

@HyperNeutrino where a,b,c are distinct

HyperNeutrino

yes

this is one of the reasons I said the list would be all distinct, though I'm not absolutely certain that that matters. It's just to disambiguate

Mr. Xcoder

@HyperNeutrino Wait your test case is still wrong, gcd(8, 12) = 4, 4 is in the list.

HyperNeutrino

For reference, the SHA-256 of my solution in Jelly is f8f60c4ef4273695cdc432a133576a92d9a48b15cba511f3aa0d1dc9c2766d96

Giuseppe

@HyperNeutrino R, 121 bytes:

function(l)max(l[sapply(seq(l),function(x)l[x]%in%combn(l[-x],2,function(g,a=g[‌1],b=g[2])max((q=1:(a*b))[!a%%q+b%%q])))])

HyperNeutrino

7:10 PM

@Mr.Xcoder whoops you're right I removed 12 at the beginning to make it not 4 and then accidentally replaced it :( yeah it's 4

Mr. Xcoder

Hence, Pyth, 16 bytes: eS@iMf!/TiFT.cQ2

HyperNeutrino

nice

Erik the Outgolfer

@HyperNeutrino as others have said second test case should result in 4 right?

HyperNeutrino

yes

Mr. Xcoder

@EriktheOutgolfer Yes.

@HyperNeutrino How long is your Jelly solution?

HyperNeutrino

7:11 PM

22 bytes :(

Mr. Xcoder

I use the combinations built-in. Maybe you should too (?)

Erik the Outgolfer

I believe I have 13 bytes

HyperNeutrino

I use the powerset builtin

now 20 with the combinations builtin thanks

sorry I meant 16

Mr. Xcoder

That would make it 18 bytes in Pyth: eS@iMf!/TiFTfq2lTy (powerset)

HyperNeutrino

ah ok

Erik the Outgolfer

7:13 PM

here

Mr. Xcoder

I want to solve it in Jelly now ಠ_ಠ

Poll: How miserably will I fail?

HyperNeutrino

not too badly I think

Erik the Outgolfer

pessimistically, there's much of a probability you'll fail ;p

Mr. Xcoder

@EriktheOutgolfer Yeah I know

HyperNeutrino

it's not whether or not he'll fail but how miserably :P

Mr. Xcoder

7:15 PM

In fact realistically, not pessimistically

Erik the Outgolfer

@HyperNeutrino "how miserably" isn't an expression we often use in a community where every last byte must get out of your code ;p

HyperNeutrino

sure

@Mr.Xcoder same thing

Mr. Xcoder

ಠ___ಠ

HyperNeutrino

:P

Pavel

@Poke no had to go to class

HyperNeutrino

7:17 PM

CMP: In my golfing language, should operators (quicks) (adverbs) be prefix or postfix?

Postfix

postfix 10/10

ok

I have 9 bytes just for getting the pairs of two combinations ಠ_____ಠ

Using Powerset

Now 3 2 bytes

AdmBorkBork

@HyperNeutrino Hopefix.

HyperNeutrino

7:19 PM

ಠ_ಠ

Mr. Xcoder

Anyfix

HyperNeutrino

no anyfix doesn't work when the arity is subject to change at runtime

Mr. Xcoder

That was a joke ಠ___ಠ

Erik the Outgolfer

anyfix is really a mess imo

HyperNeutrino

agreed

also I've decided against custom operators; just thinking about it makes my head hurt and I'd rather have a working (for a very liberal definition of "working") language than a cool idea that doesn't work.

(then again, when has anything I made every really worked?) :P

CMP: Tacit or Stack?

Mr. Xcoder

7:26 PM

NVM

HyperNeutrino

hm maybe you're checking 4 with 4, 8?

Mr. Xcoder

@HyperNeutrino Stack, much easier

HyperNeutrino

hm

which one's typically golfier? I think it's tacit IIRC

(rephrase question: is either consistently more golfy?)

Mr. Xcoder

No.

HyperNeutrino

hm ok

DJMcMayhem

7:29 PM

@HyperNeutrino Stack is easier because you can always tell what the arguments are, tacit tends to be shorter because you can reuse arguments more without duplicating the stack often

HyperNeutrino

true

Mr. Xcoder

@EriktheOutgolfer Solved it in JHT, 16 bytes; HEHE I didn't fail

Erik the Outgolfer

heh you went there :p

xnor

8:35 PM

@Lynn I think the bitwise stuff is not as magical as it looks, and you could have gotten it.

Perhaps Dennis or someone will post an explanation

There's a fairly principled way to get to most of that expression.

orlp

8:54 PM

@xnor did you see my latest challenge?

Leaky Nun

orlp

is that a salmon slice chucked on top of rice?

DJMcMayhem

Mmmmm ~~Chicken~~ pork and rice.

Yum.

Leaky Nun

that's how well my first cooking attempt went

it's pork

orlp

ah

@LeakyNun youtried.png

Leaky Nun

8:57 PM

all's well that ends well

orlp

@LeakyNun a simple recipe: broccoli, pasta, chicken, pesto

Leaky Nun

[insert murphy's law]

DJMcMayhem

@LeakyNun What's in the bowl behind it? Brussel sprouts?

Leaky Nun

@DJMcMayhem lettuce

orlp

@DJMcMayhem looks like cabbage

cut chicken in small chunks, and fry in oil (at least 10 minutes), meanwhile cook pasta and broccoli in boiling water, mix 2 eggs with a cup of cream cheese and pesto to taste, combine everything

@LeakyNun super simple super delicious :)

Leaky Nun

9:01 PM

thanks :P

orlp

with rice I like to eat shrimp and peas in a black bean sauce

which is also super simple

DJMcMayhem

@orlp Starring cause I don't know how to cook and that looks delicious

orlp

if you have time to prepare

heat bacon cubes in low heat in pan until they've lost all their fat, remove from pan, cut 1kg beef in chunks, and brown in bacon fat (do it in batches, don't overfill the pan), remove from pan, add 2 onions, 2 celery sticks, 2 carrots all sliced to the pan and cook for 10 minutes, add all beef and bacon back and cover in 1 liter of wine, let simmer in open pan for 2 - 2.5 hours, add 500gram onions, 400 grams pearl onions (weight before leaking) and 400 grams of potato cubes, simmer more 1 hour

it doesn't look that amazing, but it tastes fantastic

and you can eat like 4 days from it

and you can use tough cheap beef cuts because you're stewing

Shaggy

Is it worth posting a tip if it only saves bytes under very specific conditions?

DJMcMayhem

@orlp I can't buy wine :/

That sounds good though

Giuseppe

9:11 PM

@Shaggy I think if you've used it at least three times in different answers, it'll help somebody...

DJMcMayhem

TNB Teaches Cooking

16 mins ago, 13 minutes total – 27 messages, 3 users, 1 star

Bookmarked 17 secs ago by DJMcMayhem

xnor

@orlp nope, looking now

orlp

@DJMcMayhem which is sad, because during the cooking process all alcohol evaporates

Shaggy

@Giuseppe I haven't (yet), but it has potential for certain types of challenges.

orlp

I was going to suggest to use beer instead (which is also nice) but then I thought for a second longer :)

DJMcMayhem

9:18 PM

@orlp Yeah, try telling that to the cashier as I check out :P

@orlp I'm sure I could ~~steal~~ borrow some from my roommate :P

I'm starting to notice how often I use :P. It's almost like every other message for me

Leaky Nun

how ironic that my attempt is included as part of the teaching :P

Luis Mendo

:P

Shaggy

@DJMcMayhem I was going to ask why but then realised that would only lead to one of those moments where I'm reminded that I'm surrounded by children and I <s>run</s> shuffle off to cry quietly in the corner!

DJMcMayhem

@Shaggy I'm not a child, I just live in a society where for some strange reason it was decided that adults shouldn't be allowed to buy alcohol for 3 arbitrary years.

I don't care too much, I just think the inconsistency is really dumb. They should either lower the drinking age, or raise the adult age.

Leaky Nun

@orlp the lettuce is bitter af