[Jprogramming] Euler 73

[Pierpaolo Bernardi]

On Mon, Oct 10, 2011 at 01:56, Nick Simicich <simicich at gmail.com> wrote:
> They increased the program space in Euler 73 to up to 12000 fractions.
>  Euler 73 requires that you determine how many exclusive numerators and
> denominators there are between 1r3 and 1r2 given that the numerators and
> denominators can be up to 12000.

I solved it in scheme.  A naive algorithm runs in 21 seconds and
little memory, though my solution is not a oneliner.

In the discussion page there are much cleverer algorithms than
mine, and there is at least one J oneliner...

I know this does not help you.  Sorry.

Cheers
P.