Hopefully p decimal places is sufficiently clear that any trailing zeroes must be printed? I didn't think to explicitly state that but I guess it's implicit
I still haven't got round to changing it - it was just an experiment to see if I could use the chat refresh to give 2 frame animation. I decided changing avatar took too long to do any more testing so I abandoned the idea, but it should flash a pattern of lower frequency (thicker) lines every so often in the avatar bar to the top right. For me it's about every 10 seconds
(They all do it, I just tried to emphasise it. Yours goes from smooth to speckled alias patterned)
Yes - I put in a variety of frequencies hoping that the result would let me understand how to design a specific shape, but the scaling doesn't seem to line up an integer number of times with the full size profile avatar so I don't know how to extract the relevant numbers without trial and error, which takes forever with a slow avatar upload
I was hoping it would be a nice simple ratio and might make the basis of a challenge, but I don't think so anymore
@trichoplax Speaking of images: I find your stack snippet a little confusing. I had to look into the source code to figure out how to make it calculate the score. Accepting Enter (or preferably, adding a button) would make it a little more intuitive, I think.
All I know is that if you have stripes and scale them down until they are narrower than a pixel, they can't be represented so unless they are smoothed the ones in between the pixels get missed out, resulting in much wider stripes
@Dennis Ah good point - thank you. I suppose a dummy button would work as it still counts as the input losing focus - so it should be a very quick change
As long as that doesn't cause problems if someone clicks on it while it's in progress.
It will still work if they've updated the input, and if not I suppose it doesn't make a difference.
Lol at least this time I haven't posted something I'd already worked out the optimal solution for...
It took me so long to realise the optimal solution for the primes one that I thought it would be a challenge. I underestimated how much less time other people take than me...
With this one though, I'm expecting to be surprised but I'm confident there is no chance of an optimal solution for that size any time soon.
@Dennis Ah - I was wondering how quickly the number of pixels would go up. With that many I'll need to make it calculate in steps - anything over about 10 seconds and SE kills the snippet
When I was writing this I ran into a bug due to only checking the lengths for a new pixel against all the existing lengths, neglecting to also check if the new lengths might be duplicates of each other
@Dennis I've realised that if it doesn't show any output after 10 seconds or so then SE kills it. So whereas in jsfiddle it would just hang until finished, in a stack snippet it will fail silently and make the user think it is still calculating. So I'm working on that as a priority...
I was just wondering about provable upper bounds... That's quite low - I wonder if I need to refactor the snippet after all then
I'm beginning to think that the only reason to separate the code into short chunks that won't time out is to avoid confusion for people who post incorrect data that can be much larger
But that is also important... I can't have the snippet giving the impression it is busy calculating when it's not
According to my CJam code (619,2m*{2f#:+}%_&,), there are 118800 unique numbers that can be written as the sum of the squares of two integers between 0 and 618 (both inclusive).
n pixels require n(n-1)/2 unique distances between each other. For n = 488, that gives 118828.
Should be. 619,2m* generates all vectors in {0,...,618}x{0,...,618}, 2f# squares each component, :+ adds the squares, _& discards duplicates and , counts.
@Dennis Talking about CJam. :) Got a quick question if that's ok. Is there an elegant way to test if a given character is an upper case letter? Apply el to it, and see if the result is different?
Cool, thanks. Working on that "counting double letters" thing. I hope assuming that the input is ASCII is fine. Don't think I will come very close to Pyth anyway. regex functionality helps for this one.
I have something fairly elegant in CJam for the basic part of finding the character with the most duplicates. But now I have to exclude non-letters (should not be too bad), and list all of them when there is a tie (which could be painful).
@Dennis Ok, I got something that doesn't look too horrible. Still 37 characters compared to 21 for the best Pyth solution. Will be posted in a bit once I type it up with explanation.
Since I had good luck with RLE last last time, I used it twice this time!
In the UK they seem to show everything. I don't follow sport but in passing there seems to be a list of sports covered longer than the number of sports I thought existed...
We cover everything too but I mean, if Michael Phelps was about to swim, then any other events that were also going on were shifted to the late hours as reruns
I wouldn't go that far. CJam is more verbose for some tasks, so these operators might still help. But replace with expression and an op that actually returns the matches would be much better, yes.
Common Lisp - (golfing in progress)
A recursive implementation, totally not golfed for the moment.
(defun spiral (n &optional (d 0) )
(flet ((prefix ()
(format t "~4d~4d | " n d)
(dotimes (i d)
(princ "* ")))
(postfix ()
(dotimes (i d)
...
If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. The sum of these multiples is 23.
Find the sum of all the multiples of 3 or 5 below 1000.
This is The Question and i have tried to figure it out and it's answer given is "266333" i want to know is it...
I guess you might need to settle on just using spare characters that don't necessarily give a visual clue to their function
You want characters that take input streams from a certain number of directions and convert them to output streams in one of a certain number of directions?
Do you want each character to be able to handle multiple directions?
NetHack is a roguelike game where a player must retrieve the Amulet of Yendor from the lowest level of the dungeon. Commonly played via telnet, the entire game is represented with ASCII graphics. The game is extremely challenging and requires knowledge of many game mechanics in order to succeed.
...
Modified Game of Risk
king-of-the-hill java
Introduction
In this game, players use their armies to capture territories, fight other players' armies, and become the last man standing. Each turn, players receive a base number of armies to use at their disposal. By capturing territories in certai...
I've just decided to lower the limit on number of terms that need to be calculated so everyone's answer should execute in a short time, no matter the language
I was going to do up to the 100th term, but when I remembered that the 31st term is 140,000 digits long it might be unable to complete the task depending on the language
Just wanted to let everyone know, I'll be travelling for almost three weeks (until the 19th), with only sporadic internet access (and probably other worries than checking the PPCG flag queue first), so don't expect to see me around a lot. Doorknob knows and I'm sure he'll handle the mod duties just fine. :)
Descriptive Recursion
Recently, I made my very first contribution to OEIS by extending and adding a b-file to sequence A049064. The sequence starts with 0, and then the next values are derived from giving a "binary description" of the last item.
For example, the second element would be 10, bec...
There seems to be some confusion regarding this, so first and foremost:
ANSI escape sequences are supported by the terminal, not the shell.
Despite of what this answer did, I've shown in my answer that there's no need to involve a shell at all.
This means that all that is needed is a video te...
Common Lisp - (golfing in progress)
A recursive implementation, totally not golfed for the moment.
(defun spiral (n &optional (d 0) )
(flet ((prefix ()
(format t "~4d~4d | " n d)
(dotimes (i d)
(princ "* ")))
(postfix ()
(dotimes (i d)
...
Modified Game of Risk
king-of-the-hill java
Introduction
In this game, players use their armies to capture territories, fight other players' armies, and become the last man standing. Each turn, players receive a base number of armies to use at their disposal. By capturing territories in certai...
Descriptive Recursion
Recently, I made my very first contribution to OEIS by extending and adding a b-file to sequence A049064. The sequence starts with 0, and then the next values are derived from giving a "binary description" of the last item.
For example, the second element would be 10, bec...
There seems to be some confusion regarding this, so first and foremost:
ANSI escape sequences are supported by the terminal, not the shell.
Despite of what this answer did, I've shown in my answer that there's no need to involve a shell at all.
This means that all that is needed is a video te...
