X-Git-Url: https://git.njae.me.uk/?a=blobdiff_plain;f=problem-ideas.ipynb;h=f8653905153efa56129fd56d45200834d1975488;hb=7072d123ff779a3c08a7ac0bb09875cada18d176;hp=c595a69c5ae91534b9092e19900763b0ddb35ae0;hpb=aa80b7819bf4c4a936005d9f383965459bcea25c;p=ou-summer-of-code-2017.git diff --git a/problem-ideas.ipynb b/problem-ideas.ipynb index c595a69..f865390 100644 --- a/problem-ideas.ipynb +++ b/problem-ideas.ipynb @@ -9,6 +9,24 @@ "[Project workspace](https://learn2.open.ac.uk/course/view.php?id=206050)\n" ] }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "## Problems by day\n", + "\n", + "1. [Ticket prices](01-ticket-prices)\n", + "2. [Lift instructions](02-lifts)\n", + "3. [Door codes](03-door-codes)\n", + "4. [Word search](04-word-search)\n", + "5. [Display board](05-display-board)\n", + "6. [Tour shapes](06-tour-shapes) [Problem B](https://www.cs.uoregon.edu/Activities/Luks_Programming_Contest/problems/Problems2017.pdf): A is check if string is a closed loop, B is find the area\n", + "7. [Activity network](07-activity-network)\n", + "8. [Filling the days](08-filling-days) [Problem C](https://www.cs.uoregon.edu/Activities/Luks_Programming_Contest/problems/Problems2017.pdf): A per the problem, B when there are multiple rooms available\n", + "9. [Word chains](09-word-chains)\n", + "10. [Suitcase packing](10-suitacase-packing)\n" + ] + }, { "cell_type": "markdown", "metadata": {}, @@ -230,6 +248,8 @@ "metadata": {}, "source": [ "# More problems:\n", + "* [Advent of Code 2015](http://adventofcode.com/2015)\n", + "* [Advent of Code 2016](http://adventofcode.com/2016)\n", "* https://books.google.co.uk/books?id=85NsAHJjTJ0C&pg=PA390&lpg=PA390&dq=phone+number+problem+programming+names&source=bl&ots=c7oC9JvpZz&sig=aNnW6t_nmGK7SyAKchK0MaxqbkA&hl=en&sa=X&ved=0ahUKEwjnzcbbgs7RAhWKKcAKHQiFCDAQ6AEIJDAC#v=onepage&q=phone%20number%20problem%20programming%20names&f=false\n", "* https://www.cs.uoregon.edu/Activities/Luks_Programming_Contest/\n", "* https://www.reddit.com/r/dailyprogrammer/" @@ -247,6 +267,32 @@ "* https://www.cs.utexas.edu/users/mckinley/305j/pair-hcs-2006.pdf" ] }, + { + "cell_type": "markdown", + "metadata": { + "collapsed": true + }, + "source": [ + "Polyglot challenge languages\n", + "\n", + "- Python\n", + "- Ruby\n", + "- Haskell\n", + "- Lisp\n", + "- Prolog\n", + "- Ada\n", + "- C\n", + "- Brainfuck\n", + "- Whitespace\n", + "- x64 assembler\n", + "- Smalltalk\n", + "- Scala\n", + "- Clojure\n", + "- Lua\n", + "- JavaScript\n", + "- Java" + ] + }, { "cell_type": "code", "execution_count": null,