Data commit

Task/Josephus-problem/AutoHotkey/josephus-problem-1.ahk

@@ -0,0 +1,24 @@
+; Since AutoHotkey is 1-based, we're numbering prisoners 1-41.
+nPrisoners := 41
+kth        := 3
+
+; Build a list, purposefully ending with a separator
+Loop % nPrisoners
+	list .= A_Index . "|"
+
+; iterate and remove from list
+i := 1
+Loop
+{
+	; Step by 2; the third step was done by removing the previous prisoner
+	i += kth - 1
+	if (i > nPrisoners)
+		i := Mod(i, nPrisoners)
+	; Remove from list
+	end := InStr(list, "|", 0, 1, i)
+	bgn := InStr(list, "|", 0, 1, i-1)
+	list := SubStr(list, 1, bgn) . SubStr(list, end+1)
+	nPrisoners--
+}
+Until (nPrisoners = 1)
+MsgBox % RegExReplace(list, "\|") ; remove the final separator

Task/Josephus-problem/AutoHotkey/josephus-problem-2.ahk

@@ -0,0 +1,20 @@
+nPrisoners := 41
+kth        := 3
+list       := []
+
+; Build a list of 41 items
+Loop % nPrisoners
+	list.insert(A_Index)
+
+; iterate and remove from list
+i := 1
+Loop
+{
+	; Step by 3
+	i += kth - 1
+	if (i > list.MaxIndex())
+		i := Mod(i, list.MaxIndex())
+	list.remove(i)
+}
+Until (list.MaxIndex() = 1)
+MsgBox % list.1 ; there is only 1 element left