To the semi-regular Retina users (I think that's @mbomb007, @NinjaBearMonkey, @randomra, @Sp3000, @TheNumberOne), I've just made some significant changes and released 0.6.0. The main change is that you can now mix the other stage types with Replace mode. Also, the semantics of output in conjunction with loops have been changed (improved, I hope). Ping we if you want to know more (or read the updated README ;)).
The Challenge
Write a program that can calculate how many times and how long a ball will bounce based on a few input variables.
Input
There are three variables that will be passed. You can accept these however you like (user input, function call, etc). The variables are as follows:
height
...
@ZachGates From your profile, you're younger than me, yet you have a beard? *jealous* I've always wanted to be able to grow a beard / mustache. Don't think it will ever happen...
Evidently the calculation is based on this algorithm: (total questions - negative questions - closed - deleted) / total questions >= 0.5. @Calvin'sHobbies
I used to have a much longer beard. Had to shave it though; I started looking too old. I've been mistaken for mid-twenties and I'm not quite ready for that. :P @Justin
After a while on this site, you keep getting necromancer badges and wonder why. I didn't try to get any of my 8 necromancer badges, they just happened upon me.
Nice Answer badges are worse... I have 37. Basically, once you start getting badges like candy, why care?
I see your point. I've gone from 260 to 910 reputation on PPCG in the past few days. Been quite enjoying it honestly; never gained so much, so quickly. I suppose I'll get tired of it eventually, though.
These flags do count towards the badges when appropriately dismissed as helpful, but moderators aren't eligible to receive either Deputy or Marshal badges according to Geoff Dalgas:
The Deputy and Marshal badges are only granted to registered users - not moderators.
This has been your daily dose of Strange Corners of SE™
But at what speed? If you were traveling at light speed, you could've orbited 14 times in slightly over an hour (1.15 to be more precise). :P @Doorknob What assurances do we have that you aren't some sort of Last Thursday paradox?
@ZachGates I wouldn't call that orbiting. I say orbiting is cyclic motion around a larger gravitation body where the change in direction is caused by gravity
@Doorknob Not really. I guess if you mean actually c, something strange might happen that I'm not aware of, but it's not possible for us to travel at c. But if you meant really close to c, we are all doing that actually.
At the distance of Earth from the sun (149,597,870 kilometers), in an orbital circumference of 940 million kilometers, he could travel that at near light-speed in an hour or so and it still be considered a conventional orbit, IMHO. @Justin
We/Earth travel(s) at 30km/s (I think). 1000x slower than light :'(
I prefer doorhandles to doorknobs, IMHO. Sorry @Doorknob. It's kind of hard to turn a doorknob with feet, but it's easy enough to turn doorhandles with feet.
As far as I know, in US, grip-and-turn style door knobs are still the most popular, as opposed to lever-style handles, which dominate in the rest of the world.
Is there some UX advantage to door knobs that I am not aware of, which is the reason for keeping them around?
Edit:
To clarify the dif...
> I closed this as a duplicate under the "would good answers to that question always be good answers to this question", and got the answer yes. – isaacg Sep 15 at 23:21
I'm not sure whether I agree. You might be able to undelete that and edit it to clarify the differences between the two challenges, which will automatically put it in the reopen queue.
I thought the "You may not use numbers in variables or (un)structured objects." rule made it significantly harder. Not to mention nulling answers that compare character codes, which invalidates a handful.
Basically, the criterion is that the answers to the other question should not be able to be reposted to your question without modification. From what I can see, only some of the answers can be copied over—whether it's a duplicate is pretty ambiguous right now.
Some thoughts: - Edit the title to be more descriptive (debatable) - The rules are rather redundant. - Requiring the data to be stored exactly as a string shouldn't be bad. - A rather tricky requirement would be requiring a runtime better than O(n^2)
I don't think this is very common, but you could probably keep it deleted and post in the sandbox for feedback, and then undelete and edit the question after that.
More thoughts: - I can't see it as possible for the -10% bonus to happen - I can't see it as possible for the -5% bonus not to happen, as you are already requiring that no numerics are used
That's a perfect clarification. Better than integer literal. But OTOH, Befunge can push the number 10 with a. That's not a digit, but it's certainly an integer literal...
> If you can come up with a program that doesn't use any digits whatsoever (string and integer literals not included), you can take a bonus of -5%.
> If you can create something that uses no digits at all, including string and integer literals, you can take an additional -5% bonus, for a total -10%.
That would prevent the Javascript x = !![], which is probably a good thing. You should probably clarify and say something more along the lines of, "You may not store an integer value". Because some languages don't have variables, so much as a stack where everything is pushed
@ZachGates Do some research first to ensure that this is actually feasible.
The Challenge
Given two integers as strings, multiply them and print their product.
Rules
You may not convert any strings to integers (or decimals).
You may not store an integer value.
You may not use numbers in variables or (un)structured objects.
[1, 2, 3]
(1, 2, 3)
{"one": 1}
You may,...
Consider taking some non-negative integer such as 8675309 and computing the absolute values of the differences between all the pairs of neighboring digits.
For 8675309 we get |8-6| = 2, |6-7| = 1, |7-5| = 2, |5-3| = 2, |3-0| = 3, |0-9| = 9. Stringing these results together yields another, small...
I was looking in here, and I noticed the best runtime for multiplication of two $n$-bits numbers is $O(n\cdot \log n \cdot 2^{O(\log^* n)}$, but I can easily notice an algorithm that runs in $O(n\cdot \log n)$.
After all, we know how to multiply two polynomials from degree $n$ in $O(n \log n)$ ...
Adding can be done in linear time, so this code almost works. Naturally, 10^(2*m2) would be tricky; somehow adding that many 0s to the end of a number (but how do I do it exactly that many times...)
If we figure out a way to implement karatsuba such that it doesn't break your rules, then the challenge can be done in sub O(n^2) time
you have an Upcoming computer science test that you want to ace. the Prompt is to write a program that will sort and print an array of Various numbers and the mean of those numbers. easy enough. however, to be Overly cautious you decide To add a subliminal message. your teacher will Eye through y...
And I'm not sure if we have an efficient multiplication challenge yet, so if we remove that restriction, it may become a duplicate of yet another challenge
If you allow a simple counter, then it's possible with the time complexity requirement.
The Challenge
Write a program that can calculate how many times and how long a ball will bounce based on a few input variables.
Input
There are three variables that will be passed. You can accept these however you like (user input, function call, etc). The variables are as follows:
height
...
These flags do count towards the badges when appropriately dismissed as helpful, but moderators aren't eligible to receive either Deputy or Marshal badges according to Geoff Dalgas:
The Deputy and Marshal badges are only granted to registered users - not moderators.
As far as I know, in US, grip-and-turn style door knobs are still the most popular, as opposed to lever-style handles, which dominate in the rest of the world.
Is there some UX advantage to door knobs that I am not aware of, which is the reason for keeping them around?
Edit:
To clarify the dif...
There is a hole in my drywall from a doorknob repeatedly hitting it, is there a straightforward way to fix it?
Consider taking some non-negative integer such as 8675309 and computing the absolute values of the differences between all the pairs of neighboring digits.
For 8675309 we get |8-6| = 2, |6-7| = 1, |7-5| = 2, |5-3| = 2, |3-0| = 3, |0-9| = 9. Stringing these results together yields another, small...
I was looking in here, and I noticed the best runtime for multiplication of two $n$-bits numbers is $O(n\cdot \log n \cdot 2^{O(\log^* n)}$, but I can easily notice an algorithm that runs in $O(n\cdot \log n)$.
After all, we know how to multiply two polynomials from degree $n$ in $O(n \log n)$ ...
