- ( -) ( -). , ..
. . , , , , .., , , . , (Mathcad, Eureka, Reduce Autocad ..).
( - - ). . , . , , , ..
. . 1 (. 1.8). .
-, . - - , . 3.5.
( ): , , .
. 3.5. (), () ()
- , , .3.6.
begin S1;S2; end
. 3.6.
- , . (), () () (. 3.7).
. 3. 7. . - ( )
- , , , , . : () () (.3.8).
. -, .
-. ,
|
|
. 3.8.
- - , , :
, () () . .
- (-) , . - , , f g h, .. f=h(g()), f h g. - ( ) , .
- - , .
1. .
. 3.9 . , , b, ax2 + bx + = 0, - 1, 2.
2. , . , , .
. , .
. Ha i,j ( .3.10 i = 4,j = 4), *1, , *2; - *3 ..
. 3.9.
( ). , . , , , , . , .
, - i,j 1 8. - . , 64 , .. .
F .3.10.
88 . a[iJ] . - [1..8,1..8]..3.12 i=l, j=l.
|
|
. 3.11. 2
. 3.12. (1.1)
35
Program Tur_Konja;
var a: array[1..8,1..8] of integer;
im, jm:array(l..8] of integer;
i, j, k, n, inac, jnac: integer;
inext, jnext: integer;
begin (----- ---}
for i:=l to 8 do for j:=l to 8 do a[i,j]:=0;
im[l]:=-2; jm[l]:=l.; im[2]:=-1; jm[2]:=2; im[3]:=1; jm[3]:=2;
im[4]:=2; jm[4):=l; im[5]:=2; jm[5]:=-!; im[6]:=1; jm(6]:=-2;
im[7]:=-l; jm[7]:=-2; im[8]:=-2; jm[8]:=-l;
write(' 0<i,j<9: ');
readln(inac,jnac);
a[inac,jnac]:=1; i:=inac; j:=jnac; n:=2; k:=l;
while k<=8 do
begin inext:=i+im(k]; jnext:=j+jm (k];
if (inext<l) or (inext>8) or (jnext<l) or
(jnext>8) or (a[inext,jnext]<>0)
then k:=k+l
else begin a(inext,jnext]:=n; n^n+l; i:-inext;
j:jnext; k:=l;
end;
end;
{-------- )
for i:=l to 8 do
begin writeln; writeln; for j:=l to 8 do write(a(i,j]:2,' ')
end;
writeln; write('- = ',n-l); readln;
end.
- -. . () (), , , (). - , , , , .
1. - - ) .
2. , , .