[oclug] Programming Wars 2.0 - September 2001

[Ian Wormsbecker]

That could be an interesting contest as well. Whose program can get to the
highest in 4 minutes or something.  I notice that the output in the email only
allows about a 15 digit number to be computed before overlapping the actual
prime number with the count, therefore messing up the nice formatting of the
output. hehe. Not sure if anyone will get that high though. :)


Bart Trojanowski wrote:

> * Dave O'Neill <dmo at acm.org> [010803 11:03]:
> > On Fri, 3 Aug 2001, Bart Trojanowski wrote:
> >
> > >
> > > http://www.math.utah.edu/~alfeld/math/p10000.html
> > >
> >
> > Well, Bart may have been kidding about using this as a seed (I hope!) but
> > it will likely come in useful for testing the correctness of your output
> > if you're using a weird homegrown algorithm or obfuscated code that may or
> > may not actually be computing the algorithm you think it is.  =)
>
> Good point.  Perhaps someone could write a script to take this web page
> and convert it into the output of what we expect.  Then the diff could
> be ran against that.
>
> BTW,  What is the upper bound of the numbers that the program should
> support?  i.e. how many primes do you expect to find?
>
> Bart.
>
> --
>                                 WebSig: http://www.jukie.net/~bart/sig/
>
>   ------------------------------------------------------------------------
>    Part 1.2Type: application/pgp-signature