aparler/RosettaCodeData
1
0
Fork 0
Code Issues 12 Pull requests 3 Projects Releases Packages Wiki Activity Actions

Data update

Browse source
This commit is contained in:
Ingy döt Net 2026-04-30 12:34:36 -04:00
parent 4bb20c9b71
commit cbaf4c4b64
12390 changed files with 318560 additions and 27248 deletions
Download patch file Download diff file Expand all files Collapse all files

4
Task/Josephus-problem/Julia/josephus-problem-1.jl
View file

@ -1,5 +1,5 @@
using Memoize
@memoize josephus(n::Integer, k::Integer, m::Integer=1) = n == m ? collect(0:m .- 1) : mod.(josephus(n - 1, k, m) + k, n)
using Memoization
@memoize josephus(n::Integer, k::Integer, m::Integer=1) = n == m ? collect(0:m .- 1) : mod.(josephus(n - 1, k, m) .+ k, n)
@show josephus(41, 3)
@show josephus(41, 3, 5)

4
Task/Josephus-problem/Julia/josephus-problem-2.jl
View file

@ -1,5 +1,5 @@
function josephus(n::Integer, k::Integer, m::Integer=1)
p, i, seq = collect(0:n-1), 0, Vector{typeof(n)}(0)
function josephus(n::T, k::T, m::T=one(T)) where T <: Integer
p, i, seq = collect(0:n-1), 0, [zero(T)]
while length(p) > m
i = (i + k - 1) % length(p)
push!(seq, splice!(p, i + 1))