Progsoc Code-a-thon 2013

From ProgSoc Wiki

(Difference between revisions)
Jump to: navigation, search
m
 
Line 25: Line 25:
==Registration==
==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.
+
Individuals and teams (of 2 or 3 people) will be able to register their teams online. Please register your details  [http://progsoc2013may.eventbrite.com.au/ here].
===Who Can Enter===
===Who Can Enter===
Line 39: Line 39:
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.
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
+
* Beginner problem: Your choice of lollies!
-
* Medium problem: TBA
+
* Advanced problem: 1 movie voucher
-
 
+
-
* Difficult problem: TBA
+
==Rules==
==Rules==
Line 53: Line 51:
==Example Problems==
==Example Problems==
-
To cater for a variety of ability levels, there will be 3 different difficulty levels:
+
To cater for a variety of ability levels, there will be 2 different difficulty levels:
-
===Easy Problems===
+
===Beginner Problems===
These will be set at the level of Project Euler problems.  
These will be set at the level of Project Euler problems.  
Line 65: Line 63:
[http://projecteuler.net/problems Euler Problem Set]
[http://projecteuler.net/problems Euler Problem Set]
-
===Medium Problems===
+
===Advanced Problems===
-
 
+
-
TBA
+
-
===Difficult Problems===
+
These will be set at a level a bit easier than the level of ACM ICPC Regional Competition Problems.  
-
These will be set at the level of ACM ICPC Regional Competition Problems.  
+
A few examples:
A few examples:

Latest revision as of 12:27, 25 May 2013

Contents

Intro

The 2013 Progsoc Code-a-thon 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!

The competition will be held in an open space and competitors must bring their own laptops. Marking of answers will be done manually by a Progsoc judge.

Details

The competition will be held on:

Tuesday 28 May 2013 from 16:00 until 19:00 EST

The location is:

City Building 1, Level 3A, Concourse Area

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. Please register your details here.

Who Can Enter

  • Current UTS students
    • Both undergraduate and postgraduate students are eligible
    • Students from ALL faculties are welcome

What to bring

  • Your laptop
  • Pen and paper

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.

  • Beginner problem: Your choice of lollies!
  • Advanced problem: 1 movie voucher

Rules

  1. Entrants will have a total of 3 hours to solve as many problems as they want.
  2. Entrants are free to enter the competition at any time, and free to leave at any time. However, competitors cannot enter the competition then return later. This is to prevent cheating.
  3. Solutions must not be obfuscated, and should clearly show the algorithm used to solve the problem.
  4. The judges' decision is final.

Example Problems

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

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

Possible solutions

For more easy practice problems: Euler Problem Set

Advanced Problems

These will be set at a level a bit easier than the level of ACM ICPC Regional Competition Problems. A few examples:

More ACM problems can be found at:

Test your solutions on the ACM-ICPC Live Archive Online Judge.

Personal tools