X-Git-Url: https://git.njae.me.uk/?a=blobdiff_plain;f=problem-ideas.ipynb;h=a4fe4ab601daeaa46ce23d4dc7cc72bf38434e57;hb=84f849f83970f3a6295d09da5c1bef1fe9cec4cb;hp=f8653905153efa56129fd56d45200834d1975488;hpb=60fe51325266d0c3eb208b4f12294eda9d6d1297;p=ou-summer-of-code-2017.git diff --git a/problem-ideas.ipynb b/problem-ideas.ipynb index f865390..a4fe4ab 100644 --- a/problem-ideas.ipynb +++ b/problem-ideas.ipynb @@ -18,13 +18,17 @@ "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", + "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 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", + "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", + "7. [Virtual machine](07-interpreter)\n", + "8. [Ghost leg, simplify](04-08-amidakuji)\n", "9. [Word chains](09-word-chains)\n", - "10. [Suitcase packing](10-suitacase-packing)\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" ] }, { @@ -290,7 +294,8 @@ "- Clojure\n", "- Lua\n", "- JavaScript\n", - "- Java" + "- Java\n", + "- Dart" ] }, {