2001 LSU Computer Science High School Programming Contest

Sponsored by Texas Instruments

Contest Rules

 MAIN
  Home
  Schedule
  Registration
  Rules
  About
  Language
  
 RESULTS
  Standings
  Problem Set
  
 LINKS
  LSU
  Computer Science
  Contest Index
  HS 2000
  ACM Intl PC
  PC2
  
 THANKS
  Sponsor
  Schools
  Volunteers
 
  1. Multiple problems will be posed in English (or something loosely approximating it). Solutions to these problems must be submitted in one of the following languages: Microsoft Visual C/C++ v5.0, Borland Pascal, Microsoft Visual Basic v5.0, Microsoft QBasic, IBM Visual Age C/C++, or IBM Visual Age Java (this may change based on circumstances during the contest).

  2. Problem solutions MUST be submitted according to our guidelines because they vary some across the languages and/or implementations. All submissions will include source code only. All programs will be written to do input and output to the standard devices. This is clarifed in the Language Specific Information document.

  3. Contestants may not bring the following items into the contest area:
    1. Any device capable of computing
      Exceptions:
      • Calculators that are NOT programmable (may have memory, basic math functions) - calculators will NOT be allowed in 2002.
      • The contestants that are part of their team (maximum of three)
    2. Any machine readable or "live" documentation (ala your advisor :)
    3. Any documentation that disrupts other teams while it is being used

    Any items that the Contest Officials believe violate these rules will be confiscated until the end of the contest.

  4. Teams (or their members) MAY NOT discuss the problems with anyone other than their team members and Contest Officials.

  5. Teams (or their members) MAY NOT do anything to disrupt the contest or other teams.

  6. Teams (or their members) MAY NOT do anything to disrupt the computers and/or the judges.

  7. Teams (or their members) MAY NOT attempt to retrieve any information via the network other than the designated Contest Web Pages (No surfing the net).

  8. No attempts to discover the Judging Data and/or Judges Solutions will be tolerated.

  9. Any questions a Team has about a problem must be submitted to the Contest Judges via the ielectronic Clarification system. The Contest Judges will review the question and will either do nothing or they will respond to all teams with the clarifications.

  10. Problems are submitted for judging via the Problem Submission Software. When the Contest Judge makes a decision, you will receive electronic notification.
    • OK - Problem is correct
    • IS - Improper Submission (sent stuff other than required, hard-coded I/O)
    • CE - Compile Error (something went wrong before your program was able to be run)
    • RT - Run Time Error (your program "failed/crashed" while being run)
    • TL - Time Limit Exceeded (your program took more two [2] minutes to complete)
    • IO - Incorrect Output (your program ran but did not produce output close enough to desired)

  11. Contest starting time, ending time, and/or duration may be altered by Contest Officials if necessary (if the Pizza is late or early).

  12. No One may leave the contest area early unless an advisor comes to get them.

  13. You may be disqualified and/or have yur score reduced based on infractions of the rules.


    Figuring Out Who Won

  • The winners will be determined based on how many problems you solve (The team that solves the most problems wins, second most gets second place, third most gets third place).

  • If there is a tie (two or more teams that solve the same number of problems), the team that solves their problem(s) in the least amount of time wins. This is done by summing up how long it took to solve each problem (based on when it was submitted to be judged, each incorrect submission will count as an extra 10 minutes).

  • If there is still a tie, the team with the fewest submissions will win.

  • If there is still a tie, the Contest Official(s) will continue to dynamically invent new criteria until we find one that breaks the tie.

Last modified: Friday, 16 February, 2001 17:49:30