如何用PASCAL解答“狐狸和兔子”?
来源:百度知道 编辑:UC知道 时间:2024/06/02 17:33:38
用Free Pascal的数组和循环来做,谢谢
program tuzi;
const n=10;
var
i,j,k:integer;
a:array[0..9]of boolean;
begin
for i:=1 to n do a[i]:=false;
i:=2;
while i<=9 do
begin
a[i]:=true;
j:=1;
k:=1;
while (not a[j])and(k<=999) do
begin
k:=k+1;
j:=(j+k)mod n;
end;
a[i]:=false;
if k=1000 then writeln(i);
i:=i+1;
end;
readln
end.
program l_1(input,output);
type arrtype=array[1..10] of integer;
var
a:arrtype;
i,t:integer;
procedure find(i:integer);
var j:integer;
begin
for j:=0 to i do if t<10 then t:=t 1 else t:=1;
a[t]:=a[t] 1;
end;
begin
t:=3;
fillchar(a,sizeof(a),0);
a[t]:=1;
for i:=2 to 1000 do find(i);
for i:=1 to 10 do if a[i]=0 then write(i:8);
writeln;