Beefy Boxes and Bandwidth Generously Provided by pair Networks
Don't ask to ask, just ask
 
PerlMonks  

Re: Re: Re: Algorithm questions...

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


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

...mmm
Strange... if I remember Contest Rules, final standings base upon the number of problems solved by each team. How did your team take 2nd position? Would you mind contacting the judges? :)

By the way, I partecipated three times to regional contest. I've really had a good time. I suggest this experience to every student :)


Comment on Re: Re: Re: Algorithm questions...
Re: Re: Re: Re: Algorithm questions...
by FouRPlaY (Monk) on Nov 17, 2000 at 04:11 UTC
    The way it was explained in the Imprint (UW newspaper) is that points get deducted every time an incorrect solution is submitted. So, UW's team submitted wrong answers (several times, if I remember) and lost enough points to fall be St. Petersburg.



    FouRPlaY
    Learning Perl or Going To Die Trying

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others studying the Monastery: (9)
As of 2014-07-29 23:19 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    My favorite superfluous repetitious redundant duplicative phrase is:









    Results (229 votes), past polls