猴子抓兔子问题 求救 [复制链接]

这是我的程序  好象不好使  帮侃侃改1下啊
const m=10;
var i,k:integer;
a:array[1..1000] of integer;
begin
i:=0;k:=0;
for i:=1 to 1000 do begin
a:=i;
end;
while i<=1000 do begin
i:=i+1;
while k<=i-1 do begin
k:=k+1;
if k>m then k:=1;
if a[k]=0 then k:=k+1;
end;
a[k]:=0;
end;
for i:=1 to 1000 do begin
if a<>0 then write(a);
end;
end.

把题目报一下啊!

题目传一下哈

不床怎么帮你做呢？？？？？
 

TYPE
  point=^node;
  node=record
      data:integer;
      link:point;
end;

VAR
p,q,head:point;
i,j,l,m,n:integer;

BEGIN
read(m,n);
new(p);
head:=p;
p^.data:=1;
for i:=2 to m do
begin
  new(q);
  q^.data:=i;
  p^.link:=q;
  p:=q;
end;
p^.link:=head;
i:=1;
p:=head;
q:=p;
REPEAT
if i mod n = 0 then
begin
  q^.link:=p^.link;
  writeln(p^.data);
  dispose(p);
  p:=q;
end;
q:=p;
p:=p^.link;
i:=i+1;
UNTIL p^.next=p;
write(p^.data);
end;

  题!....题!....题!....ooooo!!!!!!!!!!!!!!!!!!!!!!..................