The Nineteenth Byte

c--

00:31

@Simd nvm, 7,6 has 3 connected components, grouped by popcount they would be [0, 2, 6], [3, 4] and [1, 5, 7]

wait that's wrong

it's still 2 connected components with even and odd popcount

OldSandboxPosts

01:00

Sandbox posts last active a week ago: Tic-Tac-Toe: Maintain the Draw!, Continuously Count Consecutive Cases, Sum of Two Intervals

lyxal

CMC: Given a list of strings, find the longest common prefix among them. There will always be at least 1 string in the list. The longest common prefix is the empty string if there's no shared prefixes.

Bubbler

reduce (prefixes of two strings; intersection; max)

Unrelated String

a very funny broken solution in jelly

`f"/ȧ` fixes the part where it doesn't actually discriminate prefixes at all but i feel like i can still construct an input that breaks it

there's a backslash in ther

f"/ȧ\

yeah it breaks on "a", "ab" lmao

plain ¹Ƥ€f/Ṁ probably is shortest

though it does give 0 for the empty case lmao

Rydwolf Programs

01:57

CMQ: Do you think MathJax scraped from main would be a representative sample of MathJax that would be used in chat?

Trying to get a sort of MathJax corpus so that I can design CIMJ to be as compact as possible

Bbrk24

02:13

How should I approach writing a quine in Trilangle? I have no idea where to begin

noodle man

02:24

@Bbrk24 does Trilangle have string literals?

Bbrk24

Nope, no string mode. Unlike most other 2D languages, " only quotes a single character

emanresu A

General approach for a quine is: Have some way to represent arbitrary text, then write a piece of code that decodes that and prepends the encoded text formatted somehow

Then compress the decoder and pass that into the decoder

Bbrk24

A string of n characters takes 2 n characters to express without tricks

That's why Hello, World is so long, it's just push H print push e print push l print print...

emanresu A

Yeah, so figure out a way to convert that string into the code that generates it

Then print the string

Bbrk24

> figure out a way to convert that string into the code that generates it

r/restofthefuckingowl

Bubbler

02:32

think of the simplest, repetitive way to store some chunk of data into your storage

Bbrk24

IP direction is also less like Befunge and more like Hexagony

Note that I said "without tricks". There are for example dupe and 2-dupe instructions

Bubbler

and then print it in two ways, one will be the code section and the other will be the data section

noodle man

@Bbrk24 can you do something similar to the Hexagony quine?

Bbrk24

The Hexagony quine I remember seeing starts by pushing a big number and then feeding it into a decoder. No, I can't, for a number of reasons:

1. Single-digit numbers take two characters to push if you can't get them by manipulating what's already there ('0). 11 and up also take 2, but you use push-char rather than push-int. 10 is fun because the interpreter ignores newlines.

2. There is no "numbers are automatically concatenated as in decimal" functionality that Hexagony has

Bubbler

yeah, hexagony kinda cheats

Bbrk24

02:36

3. Hexagony uses bigints. Trilangle uses 24-bit signed integers.

The big number decoded by the hexagony quine wouldn't even fit in a single stack slot in Trilangle

noodle man

alright

Bubbler

j exists, so you can push a bunch of numbers and then loop over them twice

Bbrk24

true! Also, the only way to edit the middle of the stack is to do multithreading

Okay so the basic plan is
1. Push a bunch of things in a clever way
2. Iterate over them twice

mm, but you see, trilangle codegen is tricky

Because you can't just output the cells in order. When you're going left-to-right, wrapping goes bottom-to-top

and the default IP direction is southwest

Bubbler

I think if you put a ^ at the top then the IP will essentially move linearly backwards? like

?

Bbrk24

Bubbler

02:42

huh

Bbrk24

None of those work with spaces removed. .13245, <21543, |31542, \45123, _25314, ^53421

So the first pass can't just be "print ", print character" or "print ', print digit"

Bubbler

hmm wow, the control flow is actively against quining

Bbrk24

That was totally by coincidence!

Bubbler

still one way to do this is to stuff the whole data pushing code in one horizontal line

this should make it a bit easier though the code size will be squared

Bbrk24

...I suppose

Bubbler

02:52

lol

Bbrk24

So then the general structure of the program would look like this:

A pair of very deliberate decisions makes everything slightly more difficult:
1. There is no "stack depth" instruction
2. Indexing past the bottom of the stack is UB

I might not be able to figure this out tonight but I have direction at least

I could even split the "bunch of data" section into two rows if I need to, and print the top half of the stack before the bottom half. This works because the last row can omit trailing NOPs; more than two rows will be difficult.

Bubbler

03:27

I'd hardcode the stack depth

Bbrk24

Yeah that’s what I’ll do

Bubbler

also just thought about making the data section a tilted rectangle

Bbrk24

I’ll probably encode it as base-96 so I get 3 instructions per stack element

lots of multibyte characters but oh well

I am going to bed now but I will certainly try this tomorrow

Bubbler

.      .
      . .
     . . .
    . . . .
   \ 1 2 3 \
  \ 4 5 6 \ .
 \ 7 8 9 \ . .
\ a b c \ . . .

Bbrk24

one last thought before I go: if I have to pad the decoder with NOPs I could hardcode the nop count

@Bubbler Hm, that is an idea

Simd

03:53

@c-- Yes!

The Thonnu

04:04

I got the code-golf gold tag badge!

Bubbler

nice!

The Thonnu

Now I can dupehammer all code-golf questions lol

Bubbler

dupe hammer is not necessarily a good thing tho

lyxal

^

I've very lately come to learn that sometimes it's nice to not have binding votes :p

The Thonnu

ik it means that you have to be completely sure before you cv

lyxal

04:09

@TheThonnu how many?

Simd

is there a way to compute the mean time to the first answer for a tag?

The Thonnu

@lyxal ?

wdym?

@Simd probably SEDE

Simd

@TheThonnu hmm

lyxal

@TheThonnu sometimes the system glitches and gives you two of a tag badge :p

The Thonnu

Oh

No I only got one

:(

Simd

04:14

@TheThonnu I don't know how to use that

The Thonnu

It's TSQL

I'll try and do something

No guarantees though

Simd

@TheThonnu thanks!

Bubbler

I actually got the motivation to learn SQL from SEDE

Simd

that is cool. Don't you need to know a schema to be able to do any queries?

i.e what tables and fields there are

Bubbler

schema is on the page where you write the query

Simd

04:17

oh right

The Thonnu

yeah

I don't think anyone actually memorises that

Simd

what is tinyint?

Bubbler

something like u8 I guess, it's just an integer anyway

Simd

0 to 255 you are right

learn.microsoft.com/en-us/sql/t-sql/data-types/…

Bubbler

some of the columns look like magic numbers, but if you scroll down the list there's some tables describing what they mean

The Thonnu

04:19

@Simd sorry, I have really bad internet, so I'll try a bit later

Simd

@TheThonnu thanks

It's tempting to learn SQL now!

lyxal

@TheThonnu one of these days someone will get two :p

Bubbler

06:42

A win after 8 years

Simd

@Bubbler wow!

Simd

06:59

@xnor is a genius, yet again

emanresu A

... That wins the whole challenge? I need to get out Vyxal, one moment

Bubbler

lol that's cheap

emanresu A

Cartesian product is doing all the heavy lifting here

Your answer is definitely much cleverer

Simd

07:37

I just saw that Seggan gives bounties to people who post fastest-code questions!

but what is @Seggan-OnStrike on strike from?

PlaceReporter99

@Simd moderation?

Simd

ah.. did someone do something wrong?

PlaceReporter99

@Simd Yes, the SE org was being very naughty.

lyxal

1129

Q: Moderation Strike: Stack Overflow, Inc. cannot consistently ignore, mistreat, and malign its volunteers

Introduction As of today, June 5th, 2023, a large number of moderators, curators, contributors, and users from around Stack Overflow and the Stack Exchange network are initiating a general moderation strike. This strike is in protest of recent and upcoming changes to policy and the platform that...

PlaceReporter99

@Simd ^

Simd

07:50

looks bad!

lyxal

-339

Q: What is the network policy regarding AI Generated content?

Earlier this week, Stack Exchange released guidance to moderators on how to moderate AI Generated content. What does this guidance include?

support mod-agreement-policy policy

That's what's started it

Simd

oh it's the robots messing with us again!

-339 is quite a score

I am mostly wondering when I will get the first answer to my fastest-code challenge

Neil

09:10

@emanresuA did you celebrate being 100th gold code-golf?

New Posts

0

Q: Continuously Count Consecutive Cases

Background Imagine that I'm creating a really long necklace, consisting of only two characters, A and B. You must count the number of occurrences of the substring AB in the string. However, since it's a necklace, you must also consider if the last character and the first character join to make AB...

code-golf string

emanresu A

Hm I didn't even notice

@Neil That reminds me it's been a year

PlaceReporter99

10:14

🙈🐒🐒🙈🐒🙊🐒🙊🐒🍌🐒🙊🙈🍌🍌🙈🙈🐒🐒🙈🙈🙊🙈🙊🐒🐵🐵🍌🍌🍌🐵🐒🍌🍌🐵🐒🙊🐒🙊🍌🙊🐒🐒🐒🐵🐵🙉🙉🐵🙊🙊🍌🐒🙊🐵🙈🙉🐒🍌🍌🙉🙈🙊🙊🙈🙈🐒🙉🐒🐵🙉🙊🐵🙉🙉🙊🐒🙊🙊🙈🍌🍌

PlaceReporter99

11:08

@Simd link?

Simd

6

Q: Compute the chromatic number of special graphs

This challenge is about computing the chromatic number of special types of graphs. Input The input will consist of two integers. A positive integer \$n > 1\$. A distance \$d < n\$. Task The two inputs values will define a graph with \$2^n\$ nodes. Each node corresponds to a different binary arr...

fastest-code graph-theory

Simd

11:21

@PlaceReporter99 what do you think?

PlaceReporter99

11:34

@Simd slightly confusing but i'll try.

@Simd for n,1, the answer always seems to be 2. Would I be correct in saying that?

Ginger

11:51

is gstreamer.freedesktop.org slow for anyone else?

Simd

@PlaceReporter99 yes

@PlaceReporter99 please ask if I can help with anything

Bbrk24

@Ginger The website loads fine for me, if that’s what you mean. I’m not installing the software

Ginger

yeah, seems to be working fine for me too now

weird

Bbrk24

12:07

I have a rough draft of the decoder for my trilangle quine, but it’s totally untested and therefore likely buggy

I have to go to work now but I’ll review it step-by-step this afternoon to be sure before I encode it and add the data section

There’s also a fairly high chance the data section will use unallocated or private-use Unicode characters

PlaceReporter99

12:28

@Simd I've answered.

Also, where is the source for the possible range for 9,2?

mousetail

If valid that's a quite short answer, I expected it to be much more complex

PlaceReporter99

12:43

@mousetail I was just looking for patterns. Turned out to be simple, except having to hardcore the value of 4,2.

mousetail

You should look if you can find a proof for the pattern or reason about where a counterexample might be

Or at least find some explanation why 4,2 doesn't work, there may be a pattern to the exceptions too

PlaceReporter99

@mousetail maybe because 2 is an even prime? But I’m not sure. Maybe the counter example is 9,2.

The Thonnu

@Simd I did the analysis you wanted

Query used

mousetail

@PlaceReporter99 That's a plausible explanation yes

The Thonnu

Python code for analysis

Unfortunately SEDE limits output to 50k rows, so I have the results for the first and last 50k rows

Oldest (last) 50k results

PlaceReporter99

12:51

@mousetail really? It was just a very wild guess.

The Thonnu

Newest (first) 50k results

So just to confirm, that's average time to first answer in seconds

And a 0 just means that all the questions of that tag in that period were self-answered immediately

mousetail

@PlaceReporter99 I don't really know either but you already treat odd and even numbers differently and primes being important for chromatic numbers seems plausible. I really don't know though except I'm curious what's going on

Simd

@TheThonnu thanks!

@TheThonnu I was hoping for one line per tag

The Thonnu

Each tag is on one line

Can you give an example output format

Simd

I see code-golf2631352023-07-21 16:11:172023-07-22 06:13:58code-golf2631352023-07-21 16:11:172023-07-22 04:20:28code-golf2631352023-07-21 16:11:172023-07-22 02:57:42

that is the same tag on different lines

The Thonnu

12:53

Don't look at the query

Simd

sorry about the copy and paste

The Thonnu

That's just raw data

Simd

ah sorry

The Thonnu

Look at gist.github.com/nayakrujul/0441ee0564b474cf5286f418236462c1 and gist.github.com/nayakrujul/c6f7a64dec7bc386ee351931853eebf4

That's the actual results

Simd

I still see the same tag repeatedly on different lines in the Results table

PlaceReporter99

12:54

@mousetail Anyways, riding guns are nice. Especially when that gun is The Fastest Gun In The West!

Simd

bash 0 ??

The Thonnu

@Simd example?

2 mins ago, by The Thonnu

And a 0 just means that all the questions of that tag in that period were self-answered immediately

Simd

it takes on average 0 seconds to get an answer?

The Thonnu

^^

Simd

is that really the average?

I mean were all bash questions self answered instantly?

The Thonnu

12:56

Yeah, there was probably only one bash question in the first 50k rows

(One row isn't one question)

Simd

ah ok :)

The Thonnu

It's one row per tag per question

@Simd which tags appear twice?

Simd

your gists are very interesting

The Thonnu

thanks :)

Simd

fastest-algorithm 13082

3.6 hours on average apparently

which time period is this over

The Thonnu

12:57

That's the oldest 50k

Simd

astest-code 221182

The Thonnu

I'll just get the dates for you

Simd

slowed down a lot

The Thonnu

2011-01-27 to 2014-02-16

Simd

the good old days :)

The Thonnu

12:59

And newest is 2021-06-15 to now

@Simd How long have you been on CGCC?

I've been here since September last year

PlaceReporter99

Simd

@TheThonnu I don't know but a loooooong time

The Thonnu

Cool

Bbrk24

I love it when I'm about to post an answer and then realize I misread the question

The Thonnu

That's happened so many times to me

Seggan - On Strike

13:02

@Simd about that...

I don't anymore

i should probably remove it

Simd

@Seggan-OnStrike very sad

but hello!

PlaceReporter99

@Simd You joined 7 months ago

Simd

@PlaceReporter99 only true in a very limited sense

Simd joined 7 months ago

PlaceReporter99

@Simd ????????????????????????????????????????????????????????????????????????????????????????????????

Simd

@PlaceReporter99 I am worried about your answer to my challenge (if it is you)

PlaceReporter99

13:05

@Simd ???

Simd

@PlaceReporter99 is it your answer?

PlaceReporter99

@Simd of course

Simd

@PlaceReporter99 it isn't computing the chromatic number

PlaceReporter99

@Simd ?

Simd

@PlaceReporter99 it's just giving the numbers I have provided

PlaceReporter99

13:07

@Simd but aren't those the same as the chromatic number?

Simd

@PlaceReporter99 yes but I only provided them for people to test their code. It would be like if the question asked you to implement addition and gave 10 examples and your code only every outputted those ten answers

and didn't actually do any addition

as a concrete example, it doesn't give the right answer for 9,2

PlaceReporter99

@Simd where's the source that 9,2 is between 9 and 16?

Simd

@PlaceReporter99 I have calculated it

but there is nothing in your code that relates to graphs

PlaceReporter99

@Simd what is it?

Simd

@PlaceReporter99 I only know it is between 9 and 16

The Thonnu

13:10

58

A: Loopholes that are forbidden by default

Optimising for the given test cases This applies to code-challenges and things like fastest-code, where you write some code that is measured by a criterion like runtime or size of your output (e.g. in compression challenges). These often employ an obviously finite set of test cases, because you ...

Simd

the goal isn't to reproduce only the numbers in the test

@TheThonnu thank you

PlaceReporter99

Let me try and do some working then.

there are 9216 bitstring pairs of length 9 with a hamming distance of 2.

The Thonnu

I'd recommend deleting it while you do that

So that someone else doesn't delete it for you

PlaceReporter99

each bitstring connects to 36 others

mousetail

I'd leave it up with a disclaimer you are working on a proof, others may be able to help finding counterexamples

PlaceReporter99

13:20

@mousetail it apparently isnt valid

Bbrk24

I just put up what I think is my first Swift answer that requires a specific compiler flag

mousetail

It's not really valid but the challenge was more intended to figure out an efficient method than as an actual challenge so for that purpose a hint towards the solution is helpful. It was really asked on the wrong site for that purpose though so IDK

I doubt PlaceReporter, while smart, has enough formal math education to effectively prove the validity of algorithms without help

Simd

@mousetail they can test their coloring using online tools too

mousetail

The algorithm is not constructive though

Simd

@mousetail which algorithm isn't?

mousetail

13:26

What online tools have you found that can verify answers?

Simd

@mousetail if you google graph coloring you get quite a lot of code

or chromatic number

or bing :)

you can also try it by hand for small cases

mousetail

But most of them are not, for me unfamiliar, easy to configure to fit your problem

Simd

@mousetail how come? You can make a graph with a bit string at each node

and then add edges

mousetail

Wow thanks why didn't I think of that. How can I use that find a counterexample to PlaceReporter's answer

Simd

  for node_from in tqdm(range(2**num_bits)):
    for node_to in range(2**num_bits):
      if (node_from ^ node_to).bit_count() == dist:
        edges.append([node_from, node_to])

@mousetail the point is that the goal isn't to reproduce the numbers in the test set.It is to do the task as set out in the challenge

that loop makes the graph for you

mousetail

13:30

Which means finding a proof of correctness for PlaceReporter's formula, or a counterexample

Simd

@mousetail well not exactly. There is no reason to believe their formula is correct

mousetail

So there must be a counterexample

Simd

yes..9,2 :)

and I am sure many more afterwards

what does it give for 9,x for x = 1...8?

PlaceReporter99

I recommend storing node connections in a set of frozensets

frozensets are just immutable sets

lyxal

just a quick note that computing the chromatic number of a graph is NP hard

so uh good luck getting a polynomial time algorithm

mousetail

13:33

This is a very specific type of graph though, there may be patterns that can be exploited

Simd

@PlaceReporter99 what does your method give for 9, x for x = 1...8?

@lyxal :) The graphs are special so who knows

lyxal

if it's NP hard for all graphs, I think that includes these graphs :p

Simd

@lyxal that's not how NP hardness works

mousetail

@lyxal That's not true. For the fully connected graphs the chromatic number is always N

Simd

@mousetail it's always 2 when the second number is odd

mousetail

13:35

Or for single chain it will be 2 or 3 depending on if the number of nodes is odd or even

PlaceReporter99

for all integers from 1 to 8:
2
8
2
8
2
8
2
4

Simd

@PlaceReporter99 thanks

PlaceReporter99

@Simd what do you need them for?

Simd

so we know 9,2 is wrong. I will see what I can get for 9,4 and 9,6

@PlaceReporter99 I wanted to let you have more counterexamples

PlaceReporter99

import math
def c(a,b):
    if b % 2:
        return 2
    if (a,b) == (4,2):
        return 4
    return 8 - math.comb(2,a-b) - 2 * math.comb(1,a-b) - 4 * math.comb(0,a-b)

source code ^

no more need to ask

Simd

13:37

right.. that is just fitting the test numbers as I mentioned

@PlaceReporter99 10,2 is a number that is at least 10

your formula gives 8

@PlaceReporter99 also... n, n/2 grows exponentially

so it should get really big as n gets bigger

PlaceReporter99

Message template:

x,2 is a number that is at least x. Your formula gives 8.

Simd

@PlaceReporter99 I think the n, n/2 part is more important

PlaceReporter99

replace x with any number 9 or larger

Simd

(when n/2 is even)

I will see if I can compute 9,2 exactly tonight...

PlaceReporter99

@Simd did you mean where n is even?

Simd

13:43

@PlaceReporter99 I meant when n/2 is even. So n is a multiple of 4

PlaceReporter99

funny how python sometimes asks questions in errors

like SyntaxError: did you forget parentheses around the comprehension target?

Simd

:)

SyntaxError: Are you feeling OK?

5

PlaceReporter99

@Simd SyntaxError: Yes

Simd

@PlaceReporter99 :)

PlaceReporter99

13:58

@Simd all bitstrings of length 9 with hamming distance of 2: gist.github.com/PlaceReporter99/…

Simd

cool

I think you would be better start with bitstrings of length 3 though

you need a method that solves the problem

and you can check it by hand with bitstrings of length 3

PlaceReporter99

btw for a string n if there are 2 different strings x,y which have the same hamming distance to n they can't possibly have that hamming distance to each other.

oh wait im wrong

Simd

@PlaceReporter99 @c-- made a series of interesting observations about this problem in this chatroom. You should be able to search for them

PlaceReporter99

but i'm right if the hamming distance is odd.

which is why it was always 2 when the second argument was odd.

Simd

@PlaceReporter99 would you mind deleting your comments from the question please? They don't make sense any more

thx

@PlaceReporter99 "For odd d the chromatic number will always be 2: The arrays for any two connected nodes differ in an odd number of positions, meaning the number of ones in the arrays will have a different parity. This means that coloring the nodes depending on the parity of the number of ones will always give a 2-coloring."

that's a good explanation

PlaceReporter99

14:15

for even numbers d, if the hamming distance between (n and x) and (n and y) is d, x and y will also have the same hamming distance iff, when mapping n to all 0s, mapped x & mapped y have exactly d/2 bits with a value of 1.

let me define what I mean by mapping n to all 0's.

actually let me reexplain

for even numbers d, if the hamming distance between (n and x) and (n and y) is d, x and y will also have the same hamming distance iff ((x xor n) and (y xor n)) have exactly d/2 bits with a value of 1.

@Simd if 9,2 isn't 8, then i feel like it's 16.

Simd

@PlaceReporter99 that may or may not be rash :)

I will see if I my code finishes in the next 12 hours

if someone's better code runs of course!

PlaceReporter99

@Simd because the sequence is 4,4,8,8,8,8 (each power of 2 (n) being repeated n/2 times starting from 4.)

a.k.a third term onwards from oeis.org/A062383

Simd

14:33

@PlaceReporter99 the central values will increase exponentially with n

and the other ones will also get bigger

are you suggested that OEIS for the y, 2 terms?

c--

15:20

don't you love when someone downvotes all the C answers to a question?

apparently the 05AB1E answer got one as well

Sandbox Posts

15:37

0

A: Sandbox for Proposed Challenges

WumpusWars King of the Hill This is probably going to stay in the sandbox for a few weeks, until I get the time to write the actual scoring code up... Yep, I'm both lazy and busy :P I'm not very good at coding challenges but I'm good at thinking up creative ideas, so this time my idea is to try ...

PlaceReporter99

15:51

CMP: what do you think would best fit a http status code of 419?

RubenVerg

16:01

I have (and by have I mean made) a htcpcp-tea setup at home so don't steal my 419

oh that's 418 I'm dumb

then I'll say "invalid character set in request"

Simd

@c-- hi

@Seggan-OnStrike did you decide we had enough faatest-code questions or that they weren't good enough?

fastest

c--

16:21

@Simd hey, I'm trying to make progress on your question but I'm having trouble coming up with anything better than brute force

Simd

@c-- you already had some ideas though

c--

I mean I didn't make any breakthroughs after that

Simd

How far can you get with brute force?

c--

right now I'm looking for a coloring algorithm that I can use without actually keeping the graph in memory, I haven't written a program

Simd

Ah ok. The chromatic number is bounded above by the maximum vertex degree which might help in some cases

@c-- I feel keeping the graph in ram isn't the bottleneck

c--

16:29

@Simd yeah but you don't need it, since it's easy to calculate the edges given a vertex

Simd

More accurately en.m.wikipedia.org/wiki/Brooks%27_theorem

PlaceReporter99

@RubenVerg I would answer “it’s a scam!”.

c--

@Simd yeah, I came across that, I'd seen it in uni but I can't find my notes :(

nvm, found them

Simd

@c-- I am impressed you found them!

c--

they weren't so old, I think these are from 2020

Simd

16:39

Oh cool

I have no idea how many people are working on the problem

Could be 0 and could be 100

c--

the vertex degree is the same for every vertex (nCd) which is pretty convenient

Simd

@c-- yes!

it's a nicely structured graph

presumably it has some nice eigenvalues/eigenvectors for those who are good at linear algebra

noodle man

16:57

mfw my code works for the first test case and no others

PlaceReporter99

17:27

What if a cop just copy-pastes a SHA256 implementation? lol — Shiran Yuan 2 hours ago

@ShiranYuan They would have to know a collision in the SHA256 hash system for the answer to be valid, so the US government would be very interested. — I am kind of a language dev 2 hours ago

@Iamkindofalanguagedev Ok so maybe sending the challenge out would help CGCC get government attention and thus more publicity :P — Shiran Yuan 1 hour ago

@ShiranYuan huh? — I am kind of a language dev 1 hour ago

@Iamkindofalanguagedev just joking lol — Shiran Yuan 1 hour ago

so many lols and :ps

mousetail

Using cryptography in cops and robbers is a standard loophole

Seggan - On Strike

@Simd the former

Simd

@Seggan-OnStrike Jan 1, Feb 2, Mar 4, April 0, May 2, June 1 and then mine

that's the count for each month

Seggan - On Strike

That's enough

Simd

you are so strict :)

I guess 24 a year is enough and maybe it will look like that

12 a year I reckon is not enough

Seggan - On Strike

17:39

~~I was losing too much rep~~

Simd

ah... I see the problem

I should get some rep so I can give it away!

I was planning to put an award on my challenge but I will be away at the end date if I do it soon

It will have to wait

Transcript for