a+b+c+d+e = e+d+f+g+h = h+g+k+b+a
each variable [a..k] is between [1-9] and each variable has to get unique number.
every number between 1-9 has to be used.
all posibilites have to be found.
preffered language is C.
Grammar parser. Right now, the grammar parser is buggy with the syntax for multiple operators in a row, and it's adding circular references that shouldn't be there
Not necessarily...it could/would suggest that it is an easier/less time consuming challenge for those who are either just starting programming or just starting golfing
Challenge:
Given a matrix (or 2d array) of 0s and 1s, output the number of steps it takes for Conway's game of life to reach a stable state, or -1 if it never reaches one. A stable state is a state in which no cells are turned on or off each step. The game must run in the given matrix, with t...
I suppose...except I'm not really sure what...or when. I usually end up golfing/programming at 1am when there's not much else to do or when I'm waiting for a batch job. Its really just something fun to do while waiting
I think that we should tag puzzles (or whatever) with an estimated difficulty tag. That way people who want a real challenge can find it and those who are just starting out can find ones they might be more able to solve.
For example consider: Distance between hands on clock
vs: Shortest path i...
@Sp3000 Agreed, it might be really hard to win those, but it would be good practice if nothing else. Plus, "good" answers in the language of choice probably already exist to compare/contrast to.
@Sp3000 Agreed, it might be really hard to win those, but it would be good practice if nothing else. Plus, "good" answers in the language of choice probably already exist to compare/contrast to.
If there's already an answer, just go for it, you will be able to check where you lost bytes, what he did better/worst than you. It will help you honing your skills even more
If there's actually a compelling reason to restrict it, there's usually not a problem. But if it's "I only want answers in these languages" for no apparent reason, then yes.
In light of a recent code golf challenge in which the specification restricts participation to JavaScript, I think it's time we revisited making a hard rule about language-specific golfs. We may discourage such challenges, but ultimately they aren't off topic. Consider Sklivvz's comment:
Eith...
@Askirkela If you mean a challenge that requires graphical output, there are text based graphics file formats that will allow any language that can output text to compete
Well half the reason why people don't golf much in Piet is because getting a working solution is one thing, but golfing down the layout and making sure the colours don't collide is a whole other problem (and usually the part that takes the most time)
@mbomb007 It says approximately Islamic Green. The link at the words "Islamic Green" goes to #009900
Haskell question: I'm trying to the Josephus function with three inputs recursively now. With the following code, I get the error Pattern match(es) are overlapped
jos_rec n k q = f q (mod (k-1) q) where
f n r = r+1
f i r = f (i+1) (mod (r+k) i)
Related: what is the standard indentation width in Haskell?