From 37d56a037dd9c67089530fda6abeac4ce606a825 Mon Sep 17 00:00:00 2001 From: Neil Smith Date: Fri, 14 Jul 2017 12:37:31 +0100 Subject: [PATCH] Updated languages for polyglot challange --- problem-ideas.ipynb | 32 ++++++++++++++++++++++++++++---- 1 file changed, 28 insertions(+), 4 deletions(-) diff --git a/problem-ideas.ipynb b/problem-ideas.ipynb index a4fe4ab..a68f4df 100644 --- a/problem-ideas.ipynb +++ b/problem-ideas.ipynb @@ -20,15 +20,18 @@ "3. [Door codes](03-door-codes)\n", "4. [Ghost leg, follow and pack](04-08-amidakuji)\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 finding if two partial loops make a whole one\n", + "6. [Tour shapes](06-tour-shapes)\n", "7. [Virtual machine](07-interpreter)\n", - "8. [Ghost leg, simplify](04-08-amidakuji)\n", - "9. [Word chains](09-word-chains)\n", + "8. [Word chains](08-word-chains)\n", + "9. [Resolving the bill](09-resolving-the-bill)\n", "10. [Word search](10-word-search)\n", "\n", "### Extras\n", "* [Suitcase packing](10-suitacase-packing)\n", - "9. [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. [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", + "\n", + "\n", + "Problem 6 taken from [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 finding if two partial loops make a whole one" ] }, { @@ -298,6 +301,27 @@ "- Dart" ] }, + { + "cell_type": "markdown", + "metadata": {}, + "source": [ + "## Polyglot challenge: languages by day\n", + "\n", + "1. [Ticket prices](01-ticket-prices): Python\n", + "2. [Lift instructions](02-lifts): Brainfuck\n", + "3. [Door codes](03-door-codes): Dart\n", + "4. [Ghost leg, follow and pack](04-08-amidakuji): Clojure?\n", + "5. [Display board](05-display-board): JavaScript/Node.js\n", + "6. [Tour shapes](06-tour-shapes): Lua\n", + "7. [Virtual machine](07-interpreter): Haskell\n", + "8. [Word chains](08-word-chains): Prolog\n", + "9. [Resolving the bill](09-resolving-the-bill): Common Lisp? Sense?\n", + "10. [Word search](10-word-search): Ruby\n", + "\n", + "Scala, Clojure?\n", + "Sense? Day 9?" + ] + }, { "cell_type": "code", "execution_count": null, -- 2.34.1