HOME | DD

Description

Just trying out a neat CSS trick I learned. There was a thread on Stack Exchange where they were talking about how to emulate the old-school CRT monitor look using CSS, and someone suggested using the text-shadow style with x and y set to 0 and successive blurs of increasing radius, like this:

color: #bbffbb ;

background-color: #000000;

text-shadow: 0px 0px 5px #77ff77 , 0px 0px 10px #00ff00 , 0px 0px 15px #009900;

I tried this out with text from one of my recent coding projects, and the result looks pretty neat.

The code itself is a solution to a problem posed on /g/ where people were talking about having an entrance exam for /g/ to filter out people who are too stupid to write algorithms. I thought I'd try it just for fun, so I wrote a program that solves the problem. It requires recursion, and this particular program prints the results of the calculation with increasing numbers of iterations. You have to precompute the probability obtained from recursion before squaring it, otherwise the algorithm takes exponential time to complete. That was how I wrote it originally, but I realized the vast majority of the computation was redundant, so I modified it to precompute the probability, thus completing in linear time. The solution I got was roughly 43.649%.

Description

Just trying out a neat CSS trick I learned. There was a thread on Stack Exchange where they were talking about how to emulate the old-school CRT monitor look using CSS, and someone suggested using the text-shadow style with x and y set to 0 and successive blurs of increasing radius, like this:

color: #bbffbb ;

background-color: #000000;

text-shadow: 0px 0px 5px #77ff77 , 0px 0px 10px #00ff00 , 0px 0px 15px #009900;

I tried this out with text from one of my recent coding projects, and the result looks pretty neat.

The code itself is a solution to a problem posed on /g/ where people were talking about having an entrance exam for /g/ to filter out people who are too stupid to write algorithms. I thought I'd try it just for fun, so I wrote a program that solves the problem. It requires recursion, and this particular program prints the results of the calculation with increasing numbers of iterations. You have to precompute the probability obtained from recursion before squaring it, otherwise the algorithm takes exponential time to complete. That was how I wrote it originally, but I realized the vast majority of the computation was redundant, so I modified it to precompute the probability, thus completing in linear time. The solution I got was roughly 43.649%.