Slides
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
0-Getting-Started
1-Input-Output
2-Numbers
3-Array
4-Sort
5-Tree
6-Dynamic-Programming
7-String-Processing
8-Graph
.gitignore
README.org
macros.sty

README.org

Programming Challenges

Instructors

Arnaud Malapert (course facilitator), Gilles Menez, Valentin Montmirail, Marie Pelleau.

Introduction

This course will introduce an interesting variety of subjects in programming, algorithms, and discrete mathematics though puzzles and problems which have appeared in the International ACM Programming Contest and similar venues.

This is a lecture-lab course in which topics are presented by the instructor, practice problems are explained, and assigned problems are completed by students both during lab periods and outside of class.

Lectures

0.Getting Started
1.Input/OutputTEST (spoj)HELLOKIT (spoj)LC-DISPLAY
2.NumbersGILNUMGILNUM (C/C++)MIRROR (with math display)
3.ArrayMKBOOK (spoj)DCEP206 (spoj)LONGEST
4.SortCADYDIST (spoj)INVCNT (spoj)YODANESS (spoj)
5.TreePT07Y (spoj)TREEORD (spoj)
6.Dynamic Programming
7.String ProcessingPLAQREBOND
8.GraphANARC08G (spoj)PARADOX (spoj)BUGLIFE (spoj)

Grading

  • Concours Prog @ UNS (40%): you will participate to a local programming contest. Your grade will depend on your rank in the contest.
  • Homework (20%): there will be problem sets over the course of the semester.
  • Final Exam (40%): there will be one final exam (1 hour) where you will be asked to solve one of two problems.

Resources

Support and Issues

Do not hesitate to post issues in order to help us improve this course.