X-Git-Url: https://git.njae.me.uk/?a=blobdiff_plain;f=problem-ideas.ipynb;h=f8653905153efa56129fd56d45200834d1975488;hb=e87288e9e5b3903773574b9244822c618a107e6e;hp=4d6b240f3d433840f8219d90aea798615d2b5a64;hpb=3afec0b916cae5ebd717b3d15c71ff9205e144f1;p=ou-summer-of-code-2017.git

diff --git a/problem-ideas.ipynb b/problem-ideas.ipynb
index 4d6b240..f865390 100644
--- a/problem-ideas.ipynb
+++ b/problem-ideas.ipynb
@@ -20,11 +20,11 @@
     "3. [Door codes](03-door-codes)\n",
     "4. [Word search](04-word-search)\n",
     "5. [Display board](05-display-board)\n",
-    "6. ?\n",
-    "7. [Word chains](07-word-chains)\n",
-    "8. [Suitcase packing](08-suitacase-packing)\n",
-    "9. ?\n",
-    "10. ?\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"
    ]
   },
   {
@@ -287,7 +287,10 @@
     "- x64 assembler\n",
     "- Smalltalk\n",
     "- Scala\n",
-    "- Clojure"
+    "- Clojure\n",
+    "- Lua\n",
+    "- JavaScript\n",
+    "- Java"
    ]
   },
   {