Given a set of formulas like this:
bacb
bcab
cbba
abbc
Give an algorithm that finds the number of unique results you can get when each variable is substituted for either "0" or "1" in every formula.
There can be $n$ formulas, each with $k$ terms and $l$ variables. Express your asymptotics in ...
@orlp "There can be n formulas, each with k terms and l variables. Express your asymptotics in these terms. Fastest algorithm wins." In regard to which variable? Is it fastest as in O()?
The problem is that when you have X big enough, you can create partitions of the grid with one of the sides being of area smaller than X, so that you can't fill it up
Now I've got the pieces in place to implement the rank operator and fill-out the remaining details of frame/cell handling. Having the rank operator should make it easier to test the cell behavior.
@Calvin'sHobbies: I thought about making you a stack snippet leaderboard for the language showcase challenge just to be nice, but then I realized that I don't know how to make one. It's the thought that counts...? :/
this is actually really annoying btw... a lot of my humour in German relies on deliberate misuse of the language, weird over- and understatements and making up words... I can't really use any of that in English, because even if my grasp on the language is sufficient to know what I'm doing, people generally tend to assume that I ... well... just made a mistake...
So I'm an idiot. I got problem D wrong once because I used an || instead of && (facepalm), and then I got it wrong again because I forgot to recompile after fixing the code. -_-
German has a lot of constructive prefixes for verbs (like en- or be- in English) and many of the prefix/verb combinations don't exist, but if you use them, they will still suggest a certain meaning which can sometimes be very funny
constructive? is that the term? generative? I think there's a word for it...
I'm always learning new things about Mac OS. The handiest thing is probably holding a letter key and being able to select an option for an accent, e.g. hold u, press 2 = ü
@Doorknob: It was actually our conversation about that that made me realize that holding Option and pressing various keys yields an extended range of characters.
Shift + Option gives even more.
But there's no real rhyme or reason to it, unlike Compose.
For example, Option + Shift + k = , the Mac logo. Wtf?
I found a mathematical formula for Problem B that outputs 100% correct answers for small input and is yet horrifically wrong for large input. This is very odd.
Announcement: MathJax will be (temporarily) disabled, only on the main site (not meta), some time in the near future. Please do not convert any other posts to MathJax.
@AlexA. Okay, as a one off thing, we'll be reverting all the posts we can find today (to flood the front page only once). But just as a reminder to everyone, for mass editing, normally, please limit yourselves to three questions at a time.
@amon I looked into it, turned out to be a deep rabbit hole requiring at major refactoring of MarkdownSharp (we'd need to make the pipeline extensible, so we could inject stuff before DoCodeBlocks in RunBlockGamut - currently all the processing happens before we ever hit MarkdownSharp, but we'd need to leverage it's block processing) — m0sa ♦Mar 16 at 11:49
And Code Golf is really the only site where arbitrary stuff in code blocks (that would cause conflicts with MathJax) is a common sight. So trying to do that amount of work for one site is just... (I'm speaking my own personal opinion only, BTW; that's not our team opinion or anything).
@orlp If it doesn't actually cause practical issues for most MathJax-enabled sites, fixing it isn't going to be a top priority. It's not like it causes XSS problems or anything of that nature.
My next question: detect which parts of markdown are code and which are MathJax. It doesn't seem that hard. (Yes, yes, I'm sure it's harder in reality.)
@orlp I'll bring it up at next week's core dev team meeting, but I can't promise anything more than that. If the team decides not to tackle it at this stage, I'll let you know.
This is kind of a special favour I'm doing because I used to be a moderator on Code Golf, and I still care deeply about this community, because otherwise, for all intents and purposes, the devs have already spoken (as quoted in Doorknob's last message).
@orlp Doing any kind of tag parsing is going to require code changes, which is effort. So again, I'd have to ask the team to decide what kind of effort is warranted.
Minimal convex partition (code-golf)
The goal of this challenge is dividing up the 'white' shape of a given 'black and white' pixel image into smaller pieces, which together form the original image (let's call this a partition). The restriction is that those pieces have to be convex, in our case...
@orlp I see. If I have time this weekend (which I don't, but I'll try), I'll see how our MathJax integration works and see if it's easy to handle that.
Just the fact that the devs are putting so much time and effort into even considering this whole situation just to make our little community happy is very encouraging.
Given a set of formulas like this:
bacb
bcab
cbba
abbc
Give an algorithm that finds the number of unique results you can get when each variable is substituted for either "0" or "1" in every formula.
There can be $n$ formulas, each with $k$ terms and $l$ variables. Express your asymptotics in ...
