1 / 9

UAkron Programming Team Introduction

UAkron Programming Team Introduction. What is a programming competition?. A set of problems, each with A functional specification Input & output format specification Sample input & output Some restrictions Only one computer per team Solutions must run within time/memory limits

zubin
Télécharger la présentation

UAkron Programming Team Introduction

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. UAkron Programming TeamIntroduction

  2. What is a programming competition? • A set of problems, each with • A functional specification • Input & output format specification • Sample input & output • Some restrictions • Only one computer per team • Solutions must run within time/memory limits • Solve as many as you can in the time allotted.

  3. How are my solutions judged? Your Program Sample Input Sample Input Sample Input Sample Input Sample Input Sample Input Sample Input Sample Input Sample Output Sample Output Incorrect Submit Real Input Real Input Real Input Real Input Real Input Real Input Real Input Real Input Real Input Real Input Real Input Real Input Real Input Real Input Real Input Real Input Your Program Real Output Real Output diff Real Output Real Output Real Output Real Output Expected Output:

  4. What are the prerequisites? • To participate in external competitions, there are requirements involving age, currently enrolled credit-hours, work history, etc. • To come to practices, there are no prereqs!

  5. Why should I participate? • From Waterloo’s website: Come to learn, come for fun, or come to win. • Deeper knowledge of the language • DSA Refresher / Preparation (and beyond) • Teamwork • See how others code • Algorithms • Types of algos • Efficiency classes • Interview skills(!) • Résumé • Competition participation • Programming interests outside the classroom • Social / Communication • Tons of developers can code. Not many can also convey their ideas clearly. • Competition

  6. What are practices like? • Fridays, 6-10 (Any major issues with this?) • Early in the semester, practices will consist of • 1 hour of discussion (algorithms, strategies, etc.) • 3 hours of a practice competition • As the ACM ECNA Competition approaches, we will insert some 4 hour practices as well. • These are subject to variation – for instance, we had an entire practice devoted to Dynamic Programming last semester. • We’ll try to broadcast the intentions for each practice.

  7. When are these contests? • Muskingum University Fall Programming Contest • Sept 24, Saturday (Rosters due Sept 19!) • ACM ICPC – ECNA (@ Youngstown State University) • October 22, Saturday • Denison Contest • February 25, Saturday • OWU Con • Marchish

  8. Can we do a sample problem as a group so I get an idea of what this is like? • I thought you’d never ask.

  9. Resources • ACM ICPC Main Site: http://cm.baylor.edu/welcome.icpc • ACM ECNA (East Coast North America) Past Contests: http://acm.ashland.edu/2011/documents.html • Denison Past Contests: http://personal.denison.edu/~feil/spring_contest/ • OWU Past Contests: http://go.owu.edu/~macsweb/contests/owu.php • UVaOnline Judge: http://uva.onlinejudge.org/ • UAkron Local Contest Archives: http://bit.ly/UAContestArchive • Waterloo Local Contest Archives: http://plg1.cs.uwaterloo.ca/~acm00/ • MIT Local Contest Archives: http://web.mit.edu/acmicpc/www/index.html • Only some years have available problem sets. • Stanford Local Contest Archives: http://cs.stanford.edu/group/acm/SLPC/history.php • Carnegie Mellon Course 15-295: http://www.andrew.cmu.edu/course/15-295/ • Includes “Useful Resources” • Baldwin-Wallace College High School Contest (many easy-medium problems): http://contest.acm.bw.edu/contest/problems/ • Various Contest/Strategy/Teamwork/Study Guides • http://anh.cs.luc.edu/314-315/basics.html • http://www.qatar.cmu.edu/hspc_archive/txt/hspc_handout.pdf • Also includes the basics of the Java Scanner class • Algorithm-specific topics • Dynamic Programming: http://people.csail.mit.edu/bdean/6.046/dp/ • Algorithm Breakdown of old Denison Problems: <Coming Soon>

More Related