Latest News
Steering Committee

Details of Asia Regional Contest Rules

Summary of Rules

  • Each team consists of up to three contestants. Each contestant must be a student enrolled in a university. At most one contestant of each team may hold a B.S. degree.
  • Each team can participate in at most two regional contests in any Asian site each year.
  • Only one team from a given institution may advance to the World Finals.
  • A special prize will be awarded to the best all-girl team and a slot in the World Finals may be given to best such team in Asia.
  • Contestants may bring resource materials such as books, manuals, and program listings. Contestants may not bring any machine-readable versions of software or data.
  • Eight or nine problems will be posed in English to be solved in 5 hours.
  • Each submitted solution to a problem is judged as accepted or rejected by a judge, and the team is notified of the results online.
  • Teams are ranked according to the most problems solved. Teams with the same number of solved problems are ranked by the least total time. The total time is the sum of the time consumed for each solved problem. This is the time elapsed from the beginning of the contest to the submittal of the accepted run plus 20 penalty minutes for every rejected run for that problem regardless of submittal time.

Computing Environment and Judging

  • Each team will use a single Pentium workstation.
  • Each team will use a single workstation with environment similar to the Word Finals.
  • Borland C++ 3.1, Borland Pascal 7.0, Borland Delphi 5.0, MS Visual C++ (At least version 6.0) and Borland JBuilder 4.0 are the available programming languages. The details of the programming environment will be available.

Problem Selection

The scientific committee is responsible for preparing the contest problems which are selected from those proposed by its member and received from the participating teams. All universities are asked to contribute to this important task. A call for problem proposal will be sent out.

So far as possible, the problems will avoid dependence on detailed knowledge of a particular application area or programming language.