Beefy Boxes and Bandwidth Generously Provided by pair Networks
"be consistent"
 
PerlMonks  

Re: Re: Re: Algorithm questions...

by larsen (Parson)
on Nov 17, 2000 at 14:19 UTC ( #42186=note: print w/ replies, xml ) Need Help??


in reply to Re: Re: Algorithm questions...
in thread Algorithm questions...

They apparently changed Contest Rules while I was looking somewhere else :). Well, I don't like new Rules: I think ACM Contest should answer the question: "Who can solve as many problems as possible, given 5 hours, a computer and a Judging System?". This question in some cases is supposed to mimic another question "Who is the best programming team?". In my opinion, and in that sense, Waterloo University is 1999's Contest Winner ;)


Comment on Re: Re: Re: Algorithm questions...

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://42186]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others musing on the Monastery: (8)
As of 2014-11-23 07:32 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    My preferred Perl binaries come from:














    Results (129 votes), past polls