约瑟夫问题（又称“猴子选大王”），谁能用Pascal语言编写（用一维数组）

var
a:array[1..100 ] of integer;
i,j,k,s,t,n:integer;
begin
readln(n);
for i:=1 to n do
a[i]:=i;
s:=n;
readln(k);
t:=1;
for i:=1 to n do
begin
if (t+k-1) mod s=0
then t:=s
else t:=(t+k-1) mod s;
if i = n then write(a[t],' ');
dec(s);
for j:=t to s do
a[j]:=a[j+1];
end;
writeln;
end.