Created sample tours and images of them
[ou-summer-of-code-2017.git] / problem-ideas.ipynb
index 6ff6da748f5d294e3d6851fa78a6ed2435dcfe96..f8653905153efa56129fd56d45200834d1975488 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. ?\n",
-    "9. ?\n",
-    "10. ?\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"
    ]
   },
   {
     "* 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,