Heh well, I just thought it'd make it easier to see what was in the string and what wasn't
You can change it back if you want :)
btw some rule-bending I contemplated was A=x,y=min(s) followed by print A,w,h at the end. It saves a byte and changes the output format, but wasn't sure if that was okay :P
@overactor We're closer to 4 than 3 questions per day (not right now, but throughout most of the weekdays), which is better than a couple of month ago (but worse than over the summer).
@PeterTaylor @Doorknob remember that guy from the Free Binary Tree question who just couldn't cope with people asking for clarification? Looks like he changed his username network wide to "Crappy Experience Bye"... I'm guessing something else happened as well, but whatever did happen, that seems like quite an overreaction for someone with 125k rep on SO and 35k on CR.
This is a comparison of regular expression engines.
== Libraries ==
== Languages ==
== Language features ==
NOTE: An application using a library for regular expression support does not necessarily offer the full set of features of the library, e.g. GNU Grep which uses PCRE does not offer lookahead support, though PCRE does.
=== Part 1 ===
=== Part 2 ===
== API features ==
== See also ==
List of regular expression software
== References ==
== External links ==
Regular Expression Flavor Comparison — Detailed comparison of the most popular regular expression flavors
Regexp Sy...
This is my first experiment with an asymptotic complexity challenge although I am happy with answers entirely in code as long as they come with an explanation of their time complexity.
I have the following problem.
Consider tasks T_1, ... T_n and machines M_1, ... , M_m. Each task takes a cert...
@Lembik If it had been a code-golf I would definitely have voted to close as a duplicate of various existing shortest-path questions. As it is, I'm debating it.
I can see you could write it that way and that might be the best way. The way I thought about it was just as a dynamic programmign problem.. but then my score is only 300,000
no vertices in sight :)
maybe I wouldn't win my own challenge
@PeterTaylor how do you include time AND cost in the graph formulation?
In the worst case the number of vertices would be (number of machines)^(number of tasks), but some of them may be pruned and some of them may be unvisited.
ok so if the most obvious formulation as a shortest path problem gives 100^100 at least and there is another method that gives 10^9 then this doesn't seem so bad, right?
... in the sense that you seem to care about practical performance, and I suspect that the practically best performing solution will be too hard to analyse to get a tight performance bound.
Normally, a question must hit 100 views before close votes age away, so as to give enough folks time to see and review it. Questions with close votes stay in the review queue until they are closed or the votes expire.
But if enough people (currently 3) select "Do Not Close" within the review que...
okay they don't get annulled right away
but they speed up the aging process of the votes and remove the question from the queue
This is Weekly Challenge #3. Theme: Genetic Algorithms
This challenge is a bit of an experiment. We wanted to see what we could do, challenge-wise, with genetic algorithms. Not everything may be optimal, but we tried our best to make it accessible. If this works out, who knows what we might see ...
I had a downvote earlier today when was some 10 snippets behind, and after I added them, the downvote got removed (and maybe turned into an upvote, I can't tell).