M只猴子要选大王,选举办法如下：所有猴子按1,2……n编号围成一圈,从一

var a,b,c,d,n,m:integer; admin:array[1..50] of integer; begin b:=0; read(n,m); for a:=1 to n do admin[a]:=a; b:=m; for a:=1 to n-1 do begin admin[b]:=0; while cn then b:=b mod n; if admin[b]>0 then c:=c+1; end; c:=0; end; for a:=1 to n do if admin[a]>0 then write(a); end.