Updated problem idea links
[ou-summer-of-code-2017.git] / problem-ideas.ipynb
index 8dc573134d520b013349a57549da278e4dcad697..a4fe4ab601daeaa46ce23d4dc7cc72bf38434e57 100644 (file)
     "\n",
     "1. [Ticket prices](01-ticket-prices)\n",
     "2. [Lift instructions](02-lifts)\n",
-    "3. [Display board](03-display-board)\n",
-    "4. ?\n",
-    "5. [Word search](05-word-search)\n",
-    "6. ?\n",
-    "7. [Word chains](07-word-chains)\n",
-    "8. [Suitcase packing](08-suitacase-packing)\n",
-    "9. ?\n",
-    "10. ?\n"
+    "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",
+    "7. [Virtual machine](07-interpreter)\n",
+    "8. [Ghost leg, simplify](04-08-amidakuji)\n",
+    "9. [Word chains](09-word-chains)\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"
    ]
   },
   {
     "* 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\n",
+    "- Dart"
+   ]
+  },
   {
    "cell_type": "code",
    "execution_count": null,