X-Git-Url: https://git.njae.me.uk/?a=blobdiff_plain;f=problem-ideas.ipynb;h=a8c7a2d051f42bd68f93516b8d02e9f557526ed8;hb=9db793681c67b0ea1be1a404a5a7c1d5afc26610;hp=48113dfbbaaff66cb6464afce142ff41c45a7811;hpb=76d7dcd5ad275f76e38a33a45e0fbdf2948c6b29;p=ou-summer-of-code-2017.git

diff --git a/problem-ideas.ipynb b/problem-ideas.ipynb
index 48113df..a8c7a2d 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. [Activity network](06-activity-network)\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"
    ]
   },
   {