Final Exam Grade Calculator
So, it's around time for finals, and many students want to know what grade they need on their final exam to achieve an A, B, or sometimes a passing grade. There are many factors here - the weight of the final, two quarters having weight, what grade the students want -...
@Optimizer, re the shortest path thing. I think the point of disagreement is into how many graphs a given 2D grid can be parsed. You seem to be assuming that it inherently represents von Neumann adjacency (each vertex has up to four neighbours: up, down, left, right), but that's really a parsing decision. In another context I doubt you'd have any problem with it representing Moore adjacency (eight neighbours, including diagonals).
To count the turns, you just need to parse it with rook adjacency: each vertex is adjacent to each other vertex on its row or column which it isn't blocked from seeing.
@PeterTaylor in a typical graph problem, yes the two things might be same. but here, its totally different approach to solve the problem and the difficulty is also at a completely different level
in other news.. 3 more up votes remaining to get a guru badge on a closed question :D (given OP accepts)
Bottom left to bottom right: in the rook graph you take one step to top-left, one step to top-right, and one step to bottom-right. That's the shortest path, three steps, which means two changes of direction.
I've never looked, but I can't see why there would be.
Ah! I misunderstood where the disagreement was.
Forget the shortest path in the von Neumann adjacency. It's completely irrelevant. What matters is the shortest path when each rook movement counts as only one step.
And now the funny part: I should have known. "This method returns the constants "True" or "False". Note that XML is case-sensitive, and that the XML specification recognizes "true" and "false" as the valid set of Boolean values. If the String object returned by the ToString() method is to be written to an XML file, its String.ToLower method should be called first to convert it to lowercase."
I'm considering doing a challenge where you generate a random Boolean expression, and print it along with its value. So essentially a combination of this and this. Would you say it's a duplicate?
Generate a Random Boolean Expression
code-golf random generation
In this challenge, you generate a random Boolean expression -- and then evaluate it.
Input
Nothing, or a random seed if your program requires one.
Output
A random Boolean expression and its value, formatted as a string
<expr> =
@Geobits @PeterTaylor another idea for the traversal counting. it's a folded strip of paper and the question is "into how many pieces can you cut it with a single cut?"
That would work. I'd probably either clearly specify it needs to be a perpendicular cut or use something like a folded string instead, to avoid cheatery diagonal answers.
Consider an array of bits, say
1 1 1 0 0 0 0 1 0 0 1 0 1 1 1 1 1 0 1 0
We call a contiguous subarray of length ≥ 5 a phase if at least 85% of the bits are the same and the first/last bits are both equal to the majority bit. Furthermore, we call a phase maximal if it is not a strict subarray of...
Is anyone else regularly annoyed by sentences like, "An odd number n is in general not prime."? (as opposed to "An odd number n is not in general prime.")
@NathanMerrill no, that's the same problem. To me that reads like "it's a general statement that odd numbers are not prime", as opposed to "it's not a general statement that odd numbers are prime". So the version of your sentence I'd be happy with is "An odd number is not generally prime."
"...is not in general prime" makes it hard(er) to parse to me. A better option of the first IMO would separate "in general" with some punctuation to indicate a pause (which would reflect the intent better to me). Commas, em-dash, parentheses... whichever your preference.
hm, I don't know... my point is that the "not" negates the "general" and not the "prime". if you separate off the "in general" that seems to group it with the "prime" even more strongly.
@Geobits although I sometimes feel that word order for negation works very differently in English and Germany anyway which probably adds to my confusion :D
I would like to ask a question about minimising the precise execution time of some code but I feel that cpu's are now too complicated and varied to make it meaningful.. sadly
"An odd number n is in general not prime" to me implies that no odd numbers are prime
@MartinBüttner Agreed, negation in English is just weird sometimes. Even if your example is technically correct, though, it feels awkward and I wouldn't say it that way.
@Optimizer The minimum required number was implied. It just needed to be stated explicitly. Otherwise, there would be a loophole where you just output "2" repeatedly until you have achieved your goal.
@Rainbolt you did not just add a victory condition. You removed the language limitation , added an extra rule that minimum numbers have to be outputted. Moreover, in the original question its nowhere even hinted by the OP that she wants it to be code-golf
@Rainbolt there can be scenarios that 2 unique combinations of unique powers can add up to N.
The language limitation had nothing to do with the remainder of the challenge. I'm certainly not the first one to remove a language restriction that made no sense.
@Optimizer The minimum required number was implied. It just needed to be stated explicitly. Otherwise, there would be a loophole where you just output "2" repeatedly until you have achieved your goal.
Ok, you win. I cannot read minds, and thus cannot make sensible edits. Instead, I'll wait two weeks and then repost my version of the challenge and immediately request that it be community wikid.
1) It needs a winning criteria. [code-golf] would be good for that 2) the restriction is the only sensible way to do it IMO 3) Tips questions should have some example code to work/start from, so this isn't a good example of that.
I'm tempted to rollback the rollback for those reasons.
If looking for a time/algorithm, she should say that. Honestly it just looks like it wants any answer, in which case it doesn't belong here at all. At least the edits made it a viable challenge (if simple).
@Optimizer You seem to be under the impression that content posted on PPCG belongs to the original author. While they certainly have final say, I am by no means overreaching by making edits that make sense.
Given that the author doesn't even appear to know how to use the site, I would venture to guess that "Wait to hear what the OP originally wanted." would result in "Well I don't know what I wanted because I'm new. 90% of the questions are tagged code-golf, so maybe I should use that."
@Optimizer It turns out that your Space Invaders edit is the only one I've ever rolled back here. I rolled back one of my own edits on an answer of mine, but I didn't really think that counted. You should feel special :P
@Geobits @PeterTaylor I've reworked the spec for the challenge. Let me know what you think. (I've removed the formal definition, because I figured with the story around it is now pretty clear and better than a formal definition could be. It also doesn't immediately give away what sort of algorithm I'm looking for.)
Into how many pieces can you cut this string?
code-golfarray-manipulation
Consider a piece of string (as in "rope", not as in "a bunch of characters"), which is folded back and forth on the real line. We can describe the shape of the string with a list of points it passes through (in order). Fo...
@Doorknob you're good with SE'ss markdown and html capabilities, right? can you figure out why that second 2<sup>31</sup> in that sandbox post won't render?
I'm not going to tell you what exactly I'm doing... but there are both counting and set approach which will handle the test cases, and there is also at least one approach that needs neither sets nor counting.
Consider a piece of string (as in "rope", not as in "a bunch of characters"), which is folded back and forth on the real line. We can describe the shape of the string with a list of points it passes through (in order). For simplicity, we'll assume all of those points are integers.
Take as an ex...
@PeterTaylor What happened to the old crowd from the early days of PPCG? I see a lot of names I don't recognize on old meta posts. Is this natural drift of a userbase over the years, or was there some split in the community?
Do I need to post on meta asking for a timeline of exactly how long I am required to wait for the original OP to get his stuff together before I receive elevated edit privileges from Optimizer?
Generate a Random Boolean Expression
code-golf random generation
In this challenge, you generate a random Boolean expression -- and then evaluate it.
Input
Nothing, or a random seed if your program requires one.
Output
A random Boolean expression and its value, formatted as a string
<expr> = 
Consider an array of bits, say
1 1 1 0 0 0 0 1 0 0 1 0 1 1 1 1 1 0 1 0
We call a contiguous subarray of length ≥ 5 a phase if at least 85% of the bits are the same and the first/last bits are both equal to the majority bit. Furthermore, we call a phase maximal if it is not a strict subarray of...
Into how many pieces can you cut this string?
code-golfarray-manipulation
Consider a piece of string (as in "rope", not as in "a bunch of characters"), which is folded back and forth on the real line. We can describe the shape of the string with a list of points it passes through (in order). Fo...
