Data update

Task/Josephus-problem/OxygenBasic/josephus-problem.basic

@@ -0,0 +1,20 @@
+uses console
+
+int n, k
+n = 41 'prisoners
+k = 3  'order of execution
+
+function Josephus(n as int, k as int, m as int) as int
+    int lm, i
+
+	lm = m
+	for i = m + 1 to n
+		lm = (lm + k) mod i
+	next
+	return lm
+end function
+
+printl "n = " n chr(9) "k = " k chr(9) "final survivor = " Josephus(n, k, 0)
+
+printl cr "Enter ..."
+waitkey