Progsoc Open Hackathon 2013
From ProgSoc Wiki
The 2013 Progsoc Open Hackathon will be a friendly and fun competition held for everyone. Individuals and teams will work to solve a set problems ranging from easy problems to more difficult problems.
Prizes will be awarded for every question solved!
The competition will be held on:
The location is:
Competition programming languages:
Any language of your choice.
Marking of answers:
Both the algorithm and the output of your code will be assessed for correctness. It will be manually marked.
Individuals and teams (of 2 or 3 people) will be able to register their teams online. An online form will be made available shortly.
Who Can Enter
- Current UTS students
- Both undergraduate and postgraduate students are eligible
- Students from ALL faculties are welcome
Prizes will be awarded for each problem solved. Both individuals and teams will receive 1 prize per question solved. Different prizes will be awarded based on the difficulty of the problem.
- Easy problem: TBA
- Medium problem: TBA
- Difficult problem: TBA
- Entrants will have a total of 3 hours to solve as many problems as they choose.
- Entrants are free to enter the competition at any time, and to leave the competition at any time.
- Solutions must not be obfuscated, and should clearly show the algorithm used to solve the problem.
- The judges' decision is final.
To cater for a variety of ability levels, there will be 3 different difficulty levels:
These will be set at the level of Project Euler problems.
Example: Write a program that adds all the natural numbers (i.e. positive integers) below one thousand that are multiples of 3 or 5.
For more easy practice problems: Euler Problem Set
These will be set at the level of ACM ICPC Regional Competition Problems. A few examples:
- Problem 3, 2006 South Pacific Regional Competition - Simple Encryption
- Problem A, 2008 South Pacific Regional Competition - Being Late
More ACM problems can be found at:
Test your solutions on the ACM-ICPC Live Archive Online Judge.