Arnaud Malapert (course facilitator), Gilles Menez, Valentin Montmirail, Marie Pelleau.
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.
|1.||Input/Output||TEST (spoj)||HELLOKIT (spoj)||LC-DISPLAY|
|2.||Numbers||GILNUM||GILNUM (C/C++)||MIRROR (with math display)|
|3.||Array||MKBOOK (spoj)||DCEP206 (spoj)||LONGEST|
|4.||Sort||CADYDIST (spoj)||INVCNT (spoj)||YODANESS (spoj)|
|5.||Tree||PT07Y (spoj)||TREEORD (spoj)|
|8.||Graph||ANARC08G (spoj)||PARADOX (spoj)||BUGLIFE (spoj)|
- 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.
- CSE 392 - Programming Challenges (2012)
- SE Problem setter’s handbook (for instructors)
Support and Issues
Do not hesitate to post issues in order to help us improve this course.