# Progsoc Open Hackathon 2013

### From ProgSoc Wiki

m (→Intro) |
m (→Rules) |
||

Line 40: | Line 40: | ||

==Rules== | ==Rules== | ||

- | # Entrants will have a total of 3 hours to solve as many problems as they | + | # Entrants will have a total of 3 hours to solve as many problems as they want. |

- | # Entrants are free to enter the competition at any time, and to leave | + | # Entrants are free to enter the competition at any time, and free to leave at any time. |

# Solutions must not be obfuscated, and should clearly show the algorithm used to solve the problem. | # Solutions must not be obfuscated, and should clearly show the algorithm used to solve the problem. | ||

# The judges' decision is final. | # The judges' decision is final. |

## Revision as of 06:04, 1 May 2013

## Contents |

## Intro

The 2013 Progsoc Open Hackathon will be a friendly and fun competition held for everyone. Individuals and teams will work to solve programming problems ranging from easy problems to more difficult problems.

Prizes will be awarded for every question solved!

## Details

**The competition will be held on:**

TBA

**The location is:**

TBA

**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.

## Registration

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

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

## Rules

- Entrants will have a total of 3 hours to solve as many problems as they want.
- Entrants are free to enter the competition at any time, and free to leave at any time.
- Solutions must not be obfuscated, and should clearly show the algorithm used to solve the problem.
- The judges' decision is final.

## Example Problems

To cater for a variety of ability levels, there will be 3 different difficulty levels:

### Easy Problems

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

### Medium Problems

TBA

### Difficult Problems

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.