Selection Contest FAQ
- What are the dates of the selection contests ?
- 25th, 28th and 30th August 6 - 9pm in PC Lab 2
- How to I get to the venue of the selection contests ?
- The contest will be held at SOC1 Level 8 in PCLab 2. SOC1 is marked with a red star in the map below.
- What languages are allowed and what compilers/IDE are available?
- C, C++, Java can be used and the computers in PC Lab 2 are installed with Dev-C++, Visual Studio .Net 2003, GNUEmacs, XEmacs, NetBeans, Java SDK 1.5
- What is the format of selection ?
- Solve 5 questions in 3 hours for each contest, open book. You need to attend all three contests in order to qualify for selection.
- What are the types of problems in the contest ?
- Algorithmic problems, eg graph, dynamic programming, greedy algorithm, divide and conquer, recursion, computational geometry, backtracking, etc..
- How to prepare for the contest ?
- Revise the materials from your data structures and algorithm module and practice by solving problems from http://acm.uva.es/problemset. You will be given an account on our local judge via email and you can practice by solving problem from the contests titled “Sample Contest” and “ICPC Practice”.
- How to use the local judge ?
- The problems are labelled A, B, C, .. so on.
- Select the button next to the problem label and you should see the description of that problem appear in the bottom frame.
- Solve the problem in either C/C++/Java and select your source code by clicking on the “Browse” button and click on your source code file. Input and output will be via standard input and output (i.e. cin/cout for C++, scanf/printf for C, System.in/System.out for Java)
- Click on the “Submit” button to send the file to the server for judging, you should see the result of your submission on the bottom frame. For detailed explanations of the results (Wrong Answer, Accepted, Time Limit Exceeded, etc) please click on the “Help” button.
- What if I have other questions ?
- send them to melvinzhang@gmail.com
