« first day (3112 days earlier)      last day (1747 days later) » 

2:35 AM
chrome update broke my workflow of starting chrome trough gdb and forcibly returning from someplace on the stack to get it to start.. luckily for me, that finally pushed me to find the problem, and turns out a password_hash_data_list array having any items in it in a preferences file was the problem.. ¯\_(ツ)_/¯
 
A__
I am posting this message to see if anyone is here.
 
A__
2:54 AM
(Vs abobql vf frrvat guvf, )V unir qbphzragrq(V nz jbexvat ba vzcyrzragvat vg) n irel zvavzny "frg-onfrq" cebtenzzvat ynathntr gung vf fhecevfvatyl irel hfrshy sbe fbyivat ceboyrzf urer.
Perqvgf gb Trbet Pnagbe, jub pnzr hc jvgu guvf ynathntr n ybat gvzr orsber V qvq.
 
 
3 hours later…
5:37 AM
are snippets disallowed even for kolmogorov complexity type problems where the output is fixed?
 
6:17 AM
-3
Q: how to sent automated email as lead generator in php

Hariharan Sfacing issues How to sent marketing emails to the available database and also if anyone reply, it should sent auto leads conversion emails like a chat bot. is it possible to do this? thanks & regards http://tapsaspire.com

 
6:57 AM
@NewMainPosts Friendly reminder that voting to close spam questions is counter-productive. Please flag as spam instead
5
 
7:09 AM
@Jonah yes
 
7:30 AM
@DJMcMayhem I CV'd because I read it as an ordinary "debug my page" off-topic question. Please accept my apology.
 
No worries
 
8:17 AM
1
Q: Determine Beckett Grading Service (BGS) Final Grade

Kevin CruijssenIntroduction: Beckett Grading Service (aka BGS), is a company which encapusulates and grades Trading Card Game (TCG) cards (i.e. sport cards, Magic The Gathering, Pokémon, Yu-Gi-Oh, etc. etc.). The TCG cards that come in for grading will be checked on four categories (which we will later refer t...

 
ngn
@A__ why the rot13? set theory and most of its notation existed before cantor. his great contribution was the realisation and proof that there's more than one infinity and his attempt to axiomatize a transfinite set theory - not very suitable for a programming language running on our finite computers
 
8:31 AM
@NewMainPosts tl;dr.
 
 
1 hour later…
9:49 AM
@EriktheOutgolfer Do you ever think of Ω and Ο as big and small "Oh" — "O mega" and "O micron"?
 
A__
10:25 AM
@ngn This simplification of the set theory only allows items that are in the 0~255 range; therefore, there are no issues related to infinity. Thus it is suitable for finite computers.
 
ngn
@A__ i understand. i just wanted to say that is pre-cantor set theory.
 
 
2 hours later…
12:00 PM
0
A: Sandbox for Proposed Challenges

Kevin CruijssenNearest Primes Converted String code-golfnumberstringprimesconversion Inspired by this SO question. Challenge: Given a string input, convert each of its characters to its integer code-point, and then get the nearest prime \$p\leq c\leq P\$ (where \$c\$ is the code-point of the given character...

 
12:28 PM
@Adám "ω" sounded like "οο" in Ancient Greek, but, in Modern Greek, they sound the same
 
ω, I see
 
1:03 PM
Anyone know why PIL.fromarray(numpy.array(_)) isn't an identity operation?
Specifically, why it completely scrambles the data?
 
 
1 hour later…
2:21 PM
0
A: Sandbox for Proposed Challenges

Ed MartyThis puzzle is based on a post on math.se. Assume I have m black shirts and n white shirts. Both shirts have a non-zero durability. Every day, I pick out a shirt to wear. Once I run out of either color of shirt, I wash all my dirty shirts of both colors and start over. Clean shirts do not get w...

 
2:41 PM
@EriktheOutgolfer I know, the omega glyphs are also just stretched out "o"s, but my question was whether you think about the name as descriptive or just as a name.
 
@Adám in daily life it's just a name, just as with every other language :D
but it has etymology
 
@EriktheOutgolfer Ah well, most Greek letters have Aramaic names describing their shape in the Hebrew (not Aramaic!) alphabet.
 
@Adám I think Greek was derived from Phoenician
 
@EriktheOutgolfer The Greek alphabet, you mean? Yes. But I'll argue that there is no such thing as "Phoenician". It is just a collective term for people in the eastern Mediterranean regions. Hebrew alphabet is a better description as it was (but isn't) actually used in writing Hebrew.
 
3:00 PM
@Adám Phoenician was definitely its own language. It's one of the branches of Canaanite, from which also stems Hebrew
 
@Adám it looks like the Greek, Aramaic and Paleo-Hebrew alphabets are siblings, given that they are all derived from the Phoenician alphabet
and yes, Phoenician was its own language
 
@EriktheOutgolfer Greek and Aramaic (=Modern Hebrew) could be considered siblings as derived from "Phoenician", but "Phoenician" is Paleo-Hebrew.
 
@Adám where I've looked it doesn't say that's the case...
 
@J.Sallé Nope, Phoenician is the Greek name for what in Hebrew is called Canaanite. (Well, those are the Anglicised terms based on the Greek and Hebrew originals.)
 
3:24 PM
@Adám it might be the language distinction, but linguistically speaking, Phoenician and Hebrew are both branches of Canaanite (which is in turn a branch of Semitic)
 
ngn
@Adám tbh on that chart hebrew looks as distant from phoenician as greek does
(just letter shapes, not language)
 
@ngn There is no Hebrew on that chart. The second column from right is Aramaic (used for Hebrew today). The middle column is actual Hebrew/"Phoenician".
The chart is also missing four Aramaic letter forms that do not exist in the original Hebrew alphabet.
 
ngn
@Adám final forms?
 
@ngn yes.
 
I like the fact that Phoenician has Tensor Product as a letter
 
3:30 PM
@J.Sallé ×?
 
@Adám
God, that's very badly rendered. This should be better ⊗
 
@J.Sallé That's Tet.
@J.Sallé Also I-beam: 𐤆‎
 
@Adám I've no idea what it is, only that it's used as the tensor product notation hahahahah
Also the I-beam, yes!
 
𐤒‎ Rotate?
 
@Adám very close, but not quite. Also, for the circular function
 
3:37 PM
@J.Sallé 𐤓‎ is actually the same as
It makes the "R" sound.
@J.Sallé 𐤉 is actually the same as
It makes the "I" sound.
 
@Adám It's mi-rho-red!
@Adám and this one has an extra arm, it seems
 
@J.Sallé Of course. Hebrew is right-to-left, while Greek is left-to-right.
@J.Sallé Extra finger, actually, but they are supposed to be much closer together than the way it renders by me.
 
@Adám Ah, naturally. Makes perfect sense.
@Adám Yeah, here it renders almost as a mirrored F
 
@EriktheOutgolfer From Wikipedia:
> Samaritan is a direct descendant of the Paleo-Hebrew alphabet, which was a variety of the Phoenician alphabet in which large parts of the Hebrew Bible were originally penned. All these scripts are believed to be descendants of the Proto-Sinaitic script. That script was used by the ancient Israelites
 
ngn
@Adám "penned" :D
 
3:43 PM
@ngn Yes?
 
ngn
@Adám they had pens then?
 
@ngn Yes.
 
Fun fact, the English word "pen" is remarkably similar to the Portuguese word "pena", which means "feather" (and therefore "quill"). A quill for writing is also called a "pena" in Portuguese, so I think there might be some influence for the word "pen"
and wiktionary confirms it: [...] from Latin penna (“feather”),...
 
@Adám eh, a "variety" can be a descendant pretty well
 
@J.Sallé I think writing with a feather is called to pen.
@EriktheOutgolfer The Israelites exiting Egypt were obviously contemporaries with the Canaanites.
@J.Sallé It is supposed to look like this:
 
3:51 PM
Oh, I see
 
@Adám tbf I can create a descendant language in one second: yeH, siht si desreveR hsilgnE!
 
@EriktheOutgolfer eurT.
CMC: Given a string, reverse each run of [A-Za-z]
@J.Sallé The Greek name Yota is from Aramaic Yoda from Hebrew Yad, forearm.
 
4:10 PM
@Adám Can we assume that the string will not contain newlines?
V, 12 bytes: (doesn't support newlines in input): ÓÁ/ò&ò<CR>Îæ<CR>Íî
 
Wish this more challenging question got more traction:
13
Q: Bridge the Gaps

flawrGiven a black and white image with a white background and a set of black dots, paint a set of white pixels red, such that there is a path between each pair of black pixels. Details A path is a set of connected pixels (8-neighbourhood connectivity). Black pixels can be used as part of the path...

I have some ideas for what strategies to use, but frankly my T-SQL skills probably don't do much good here.
 
@BradC that is nice to hear!
I do actually plan to post an own answer, but I was advised to wait a little bit:)
 
My idea for a solution, if anyone wants to run with it:
1. Identify all sets of disconnected paths
2. Pick one disconnected path, either the smallest, or maybe at random
3. Identify the closest other non-white pixel, outside that path
4. Draw a red path from the path to the other closest non-white pixel
5. Go back to step 1
 
@DJMcMayhem Sure.
 
The python validation program in the question actually already does a lot of the work, so that might be a good starting point.
 
4:20 PM
2
Q: Decode a variable-length quantity

gwaughA variable-length quantity (also referred to as VLQ or uintvar) is a way to encode up to a 28 bit integer value using only as many bytes as necessary. This was used in MIDI file format as a way to minimize the size of certain event data. The way it works is fairly simple. As a big-endian series...

 
ngn
@BradC +1, that's a good challenge
 
But I literally know nothing about Python, so I'm not the person to pick it up
 
@BradC this is quite close to what the answer is doing that I wrote yesterday
 
ngn
@BradC you don't have to solve it in python
 
**CMC:** Find the (lexicographically) smallest rearrange-
ment of these digits that is bigger than the
current pattern:
3 1 4 1 5 9 2 6 5 3 5
 
4:22 PM
@flawr Yep. Its not completely optimized, my strategy would connect 4 equi-distant dots in corners by 3 sides of a square, where the optimized connection is something in the middle
 
hmm.. not sure why CMC didn't work
 
@ngn Oh, I know, but my skillset is T-SQL and Excel VBA (and MineCraft command blocks), none of which seem well suited for this challenge
 
@BradC not necessarily, the distance the 8-connecteness induces would result in the diagonal having the same distance as a side of a square
 
@Anush Not sure I understand, wouldn't that just be 3 1 4 1 5 9 2 6 5 5 3
 
@DJMcMayhem hmmm
 
4:24 PM
@Anush can you elaborate how you measure the smallness of a rearrangement?
 
@flawr true, I guess it would depend on how you identified and drew the red line
 
@Anush No markdown in multi-line msgs. Use multiple msgs, and they will visually merge.
 
I think the question wasn't good. I was hoping for code that would work for any pattern of that length
 
@flawr I think the result has to be minimised, not the rearrangement.
 
I think a general approach to that would be to swap the two least significant digits that are ascending IIUC
 
4:28 PM
nope, for example (4, 1, 3, 2) can be rearranged to (4, 2, 1, 3) which is smaller than (4, 3, 1, 2) but larger than the original
 
So find the last digit where the next digit is larger than it, and swap it with the smallest digit that occurs after it and is also larger than it?
 
ok good.. it's not so trivial in the end :)
 
(And then sort the rest of them after it)
 
@flawr By that measure, I think that would make an X through the middle the cheapest way to connect 4 equi-distant dots
 
BTW @Anush, I always enjoy your algorithm/CS riddles :)
 
4:32 PM
Perhaps that means we ought to prefer a diagonal line instead of a straight one (of equal length) when connecting paths, to give better "connection points" for future paths
 
@BradC ah right, yes that makes sense!
 
@flawr That would be possible via my algorithm, if we chose the diagonal point for our first connection
 
@DJMcMayhem thanks!
 
@DJMcMayhem actually, the answer isn't always a single swap: imagine you have (9, 4, 3, 2, 1, 8), the returned value should be (9, 8, 1, 2, 3, 4)... or wait
(9, 4, 3, 2, 8, 1) would work too over there
 
@EriktheOutgolfer Yeah, my first description wasn't enough so I added some further caveats
 
4:35 PM
hm... let's find a counterexample to the second description...
 
In that case, 1 is the last digit where the next digit is larger, so a swap there is correct I believe
 
yeah that was a failed attempt :P
 
My new full description is Find the last digit where the next digit is larger than it, and swap it with the smallest digit that occurs after it and is also larger than it. Then sort the rest of the digits that follow afterwards.
 
lol description v3
 
Please feel to copy any of the riddles I post here that look good enough in chat into the main. I rarely have time to write proper questions sadly.
 
4:39 PM
@Anush why don't you make a neural network that converts your CMCs to full blown main challenges? :D
 
0
Q: Regex - Find Dates in SQL Query for Specific Fields

NxtqObjective Write the shortest/fewest regular expression(s) that can locate all date values for a specific field [datetime].[datetime] in the example string. For example, using the sample query below, your regular expression should find the value (or values for BETWEEN, IN, NOT IN, etc.) for any...

 
@DJMcMayhem wait a minute... isn't that just the first version of the description?
because "the smallest digit that occurs after it and is also larger than it" is exactly the "next digit"
I guess the sorting part is different
 
@EriktheOutgolfer No cause there could be multiple digits after it. Like your (4, 1, 3, 2) the 1 should become a 2, not a 3
 
oh I missed that
so yeah, v3 appears to be correct
 
@NewMainPosts that question.... doesn't seem very well formed for this site. I have many questions
 
4:47 PM
it's just unclear
 
@flawr good idea! :)
 
@Anush @EriktheOutgolfer Python 3: Try it online!
Not the most readable in the world, but I think it works. lemme know if you can break it
 
@DJMcMayhem cool.. now we just wait for the counterexamples :)
 
actually, a simpler algorithm would be "get the permutations in lexicographical order, find your original and pick the next one" :D
 
@EriktheOutgolfer actually that is the solution I was expecting!
 
4:51 PM
yeah but that would be plain brute force :(
 
@DJMcMayhem you reinvented numpy.diff :)
 
Psh, that's a boring one :P
 
(also, "getting the permutations" requires itertools... yuck)
 
@Anush Oh, man that's good to know. I always hate writing that out lol
 
what is wron with itertools?
 
4:53 PM
numpy is basically another programming language that is easy to call from python
 
@Anush do we actually have a diff challenge?
 
mixing lists and numpy arrays is nearly always fatal too
@flawr I don't know
I did get numba to work today which was a first for me
 
@Anush ok there is [this ](codegolf.stackexchange.com/questions/142458/nth-differences/…) which seems to be more general
 
@DJMcMayhem to make it cleaner you can use enumerate(l[1:], 1) instead and ditch the trailing [1:]
 
@Anush that sounds interesitng, what are you using it for?
 
4:55 PM
@flawr I wanted to speed up a python implementation of the viterbi algorithm
turns out it just worked out of the box apart from having to using numpy.int instead of int
like all the methods of speeding up python that I know,it's amazing when it works
and completely useless in all the cases it doesn't
 
@Anush @EriktheOutgolfer Much worse solution: Try it online! :P
 
if sorted(int(x) for x in str(i)) == sorted(l): !! I feel that line should be a crime :)
 
ain't even have the decency to input as an int
 
I told you it was a worse solution :P
 
:)
 
4:59 PM
That's like what, O(10**n * n*log(n))
 
@DJMcMayhem ⁂
 
@BradC there is a new answer
 
@flawr Yep, saw it. It looks pretty good.
 
I now posted mine anyway since it was outperformed by a large factor
 
@flawr Scoring should probably be just the grand total of all red pixels, instead of the product
But too late now
 
5:12 PM
@BradC I actually explicitly constructed this scoring scheme so that the small test cases still have enough weight
(Because I only made a few large cases.)
 
@flawr Makes sense, I suppose
 
otherwise it would be way too easy to just compensate
of course the sum would also be interesting, but I would probably have had to design the test cases a little more carefully
 
ngn
my strategy was going to be: identify connected components; for each white pixel compute distances to all connected components; for each pair of components find a pixel that connects them most efficiently; then use a minimum-cost spanning tree algorithm
that would obviously not be optimal, but i wanted to experiment by modifying the mcst algorithm to work with triples (or more) of components too
the new answer's strategy looks simpler and more efficient
 
@ngn I like the idea of iterating through the white space to look for connection points: you could find spots that are equi-distant to 3 different unconnected components, instead of just 2
 
0
A: Sandbox for Proposed Challenges

ouflakEmit Hawking Radiation Background: In empty space, occurring all the time, there are pairs of particles that appear and then cancel each other out. At a certain distance from a Black Hole, it's possible that a pair particles might spontaneously appear and, if the distance is just right, one of t...

 
ngn
5:24 PM
@BradC they don't have to be equi-distant, just have an optimal sum of distances to the given components
eg between certain 2 components you might have a unique optimal path of even length, and then none of the white pixels will be equi-distant
two of them will be almost equi-distant. same goes for 3+ components
 
 
2 hours later…
7:14 PM
@flawr FYI I deleted my comment about one test pic being gray-scale, since you've fixed it.
You can clean up your replies as well if you like
 
Ha ha, sending paint.net diagrams in corporate emails
 
@BradC you can flag obsolete comments as "no longer needed"
 
7:31 PM
@BradC Hmm, garbage algo idea: Paint all white pixels whose 8 neighbors are white an arbitrary color. Paint the rest of the non-black pixels red, revert the control color back to white.
Score: Many
 
@EriktheOutgolfer Ah, never knew that was an option; thanks!
@Veskah I think all that is doing is expanding the size of each connected region by one pixel in all directions, which is pretty much what @flawr is doing in his answer
 
@EriktheOutgolfer What?
 
Oh, yeah I guess fair enough
 
@Adám comment → flag → reason: no longer needed
 
@dzaima uh, I've never even dared clicking the flag icon because the title="Flag this comment for serious problems or moderator attention". I don't know if it will ask me to confirm, or it is permanent or what.
 
7:39 PM
@Adám It's just like normal flagging.
With the benefit that (unless you choose the "custom message" option) moderators won't see it for an hour, by which time NLN-on-HNQ comments will have reached the NLN-flag limit to be auto-deleted, and not bother anyone.
 
@wizzwizz4 Oddly enough, the confirmation boxes have completely different styling.
@wizzwizz4 NLN?
So what happens if I choose no longer needed?
 
@Adám I think it's the same logic as VTCing posts
If enough people or a mod does it, then it happens
 
@J.Sallé Oh, wow. Aspects of SE I never knew about…
 
@Adám if the comment is deemed to be unnecessary in the first place by SE (e.g. it starts with "Thanks"), it gets deleted automatically; if it gets 6 (?) NLN flags, it's deleted automatically; if a mod sees the flag and casts a "helpful" feedback it's deleted; there are usually no consequences for having a comment of yours deleted for that (unless, of course, you're doing something really unnecessary, like commenting "me too" all the time)
 
Thank you all for educating me. Now, off to hunt pesky comments…
 
8:39 PM
@BradC thanks for letting me know!
 
 
1 hour later…
9:55 PM
@EriktheOutgolfer Additionally, if a mod flags as NLN it automatically marks it as Helpful. (cough [ • Deputy] [ • Marshall] cough)
 
Unfortunately, mods can't get those badges :P
Unless they get them before coming a mod (cough, Mego)
 
@wizzwizz4 (lol joke's on you can't get those :D)
@DJMcMayhem unless they make a new account, flag from there, have their flags approved by other mods (not themselves to avoid CoI) and then merge the new account with their mod account er... yeah, totally impossible :D
 
@EriktheOutgolfer It would probably be easier to hit the 500 flags, resign from mod-ship, and then ask to be reinstated lol
Of course, you'd wait a little while to make it more subtle
 
10:11 PM
yeah that's what happened somewhere else a few months ago, but pretty sure you can't willingly do that without staff noticing some shady business going on, while, to merge two profiles, staff will most probably not look at the flag count of the other account just to make sure the mod doesn't get dem unearn'd badges ;D
(the incident was due to some mishap from the mod's account while they were unavailable, not because they wanted to de-mod themselves momentarily)
 
> unearn'd
Wouldn't it have been earned though? :P
 
well if you think about it it would be plain sockpuppetry, so... no, the opposite of earned
like, the effort those badges require can't be met with a diamond
 
@EriktheOutgolfer Well, I'm 5 flags away from finding out. Should only take a few months.
(Obviously I'm not going to raise fake flags or anything; NLN comment flags and spam flags only for me!)
 
yeah... don't get your hopes up, the system is known to work as documented
 
They made an exception so that moderators couldn't get it?
 
10:17 PM
hm, do mods' flags get automatically marked as helpful?
 
@EriktheOutgolfer Only some flags.
Just checked, and spam flags are marked helpful by yourself, so they probably wouldn't count.
 
I have Marshall on a couple sites that I don't even use because of charcoal autoflagging
@EriktheOutgolfer some, not all
 
I can't remember which ones are marked helpful by Community, but I assume those would count (unless moderators are banned from earning it, but then the account merger plan wouldn't work).
 
pretty sure that merging two accounts merges the badges together...
 
The only flags I find useful are "moderator attention needed" because those are like a little reminder to myself to look at something later
 
10:20 PM
> Hey mods, don't act on this flag, it's a reminder for DJ!
 
@EriktheOutgolfer That can't be right.
@DJMcMayhem I'm glad I'm not the only one. I've avoided doing that much because it seemed too much like stats gaming, but I'll do so more in future.
 
@wizzwizz4 how would the badge get "erased", given that they're pretty much set in stone from the moment you get them? (unless you're caught sockpuppeting)
the only exception I can think of is merging two accounts where both of them have a specific one-time badge, in which case the badge will not be duplicated
 
@EriktheOutgolfer I think I'm thinking of account deletion.
In that case, they're recalculated. I'm tempted to say it's the same case for account duplication, but I don't know.
 
yeah, the specifics aren't documented anywhere
 
@EriktheOutgolfer It's 'cause of people like us.
Given no documentation, we won't try to find out.
Given complete documentation, we'll already know.
But given not-quite-complete documentation…
And complete documentation would let people game the system, so we're never getting that.
 
10:28 PM
> "For Science" Mods Get Demodded for Diamond Mishandling
more like given complete documentation people will be less tempted to try
that is, other than officially confidential stuff like the keywords for immediate NLN deletion or the algorithm for escaping a post ban
it's better to know that "your little strategy won't work, nice try" than have somebody attempt their strategy one day
 
@EriktheOutgolfer I've petitioned several times for a sandbox site, where we're all mods.
It's been turned down every time.
There are various stupid reasons, like "no, just no", "that would be a terrible idea", "moderators can send emails", "you could bring down all the servers", "we don't have the resources for that kind of thing"… I don't believe a word of it, but them's the rules.
 
@wizzwizz4 I think there's a better reason against it: some mod tools/abilities are confidential
 
@DJMcMayhem See? So many stupid reasons not to give us all full reign of the great-power-great-responsibility Stack Exchange superweapons.
 
0
Q: Smallest Konami Code in C#

Taylor SparkRules: Konami code MUST be in format: "Up, LAlt, Left, RControl" Must be written in C#, C++, or VB, But I recommend C# Also must be written in a Windows Form (nothing else, just the form) Finally must call the simple code Ive written below Details: I need the program to call (Or a CPP, VB al...

 
pretty sure DJ's worry is that that would reveal confidential mod tools
it's like a police force having its secret technology and ops revealed; everything can go wrong
 
10:45 PM
Yeah, but surely everything going wrong is worth seeing what happens when you merge a user with Community.
Or suspend a moderator / employee.
 
^ has been tested, suspension does nothing on mods
 
@EriktheOutgolfer On chat, it doesn't.
I don't recall it being tested on a main site.
 
it's been posted about over MSE, they can even unsuspend themselves
 
But I suppose you could try creating an unregistered account and merging their mod account into that one…
 
diamond would be merged
 
10:55 PM
@EriktheOutgolfer Yeah, I suppose it probably would.
 
I mean, it has been done before
 
@EriktheOutgolfer Seriously‽
 
yeah, although I won't reveal too much
 
I understand.
 
11:12 PM
@wizzwizz4 @DJMcMayhem Isn't it unusual that a super-high-rep user gets a year's worth of chat suspension?
Wait, last message 258d ago and cannot chat for 274 days‽
Must have been some seriously bad chat behaviour to be suspended for 532 days. Also a strange suspension length.
 
We cannot really comment on any of that.
 
@Dennis Can suspended chat users enter chat rooms?
 
Yes.
 
11:27 PM
I thought suspensions had fixed lengths, 1 day, 1 week, etc. Are you allowed to say how they can end up being such an arbitrary length?
 
They don't. Chat suspensions are specified in hours.
Suspensions on main usually follow a pattern, but that's just a convention.
 
12770 hours still seems odd. 10000 is at least round.
 
I want to make an expanded version of codegolf.stackexchange.com/questions/147568/…. I want to add label golfing for gotos, automatic #define golfing, and C comment golfing. Should I add a bounty to the question, edit the question, or open a new question?
I have a test file for the challenge
 

« first day (3112 days earlier)      last day (1747 days later) »