Uses crt;
type
masType = array[1..15,1..15] of integer;
masT = array[1..1000] of boolean;
var
i,j,n, x, cnt,start,finish:integer;
visited:masT;
a:masType=
(
(0,1,0,1,1,0,0,0,0,0,0,0,0,0,0),
(0,0,1,1,0,0,0,0,0,0,0,0,0,0,0),
(0,0,0,0,0,0,1,0,1,0,0,0,0,0,0),
(0,0,1,0,0,1,1,0,0,0,0,0,0,0,0),
(0,0,0,1,0,0,0,1,0,0,0,0,0,0,0),
(0,0,0,0,0,0,1,1,0,0,0,0,0,0,0),
(0,0,0,0,0,0,0,1,1,1,1,0,0,0,0),
(0,0,0,0,0,0,0,0,0,0,1,0,0,0,0),
(0,0,0,0,0,0,0,0,0,1,0,1,0,1,0),
(0,0,0,0,0,0,0,0,0,0,1,0,0,1,0),
(0,0,0,0,0,0,0,0,0,0,0,0,0,1,0),
(0,0,0,0,0,0,0,0,0,0,0,0,1,0,1),
(0,0,0,0,0,0,0,0,0,0,0,0,0,0,1),
(0,0,0,0,0,0,0,0,0,0,0,1,1,0,0),
(0,0,0,0,0,0,0,0,0,0,0,0,0,0,0));
procedure dfs(var a:masType; var visited: masT; n, v, x: integer; var cnt: integer);
var i: integer;
begin
    if v = x then
    begin
        Inc(cnt);
        exit;
    end;
    if(v = 10) then visited[v] := true;
    for i := 1 to n do
    begin
        if (a[v, i]=1) and not visited[i] then
        begin
            dfs(a, visited, n, i, x, cnt);
        end;
    end;
    visited[v] := false;
end;
begin
    writeln('Матрица смежности:');
    n:=15;
    for i:=1 to n do
    begin
        for j:=1 to n do write(a[i,j]:2);
            writeln;
    end;
    start := 1;
    finish := 15;
    dfs(a, visited, n, start, finish, cnt);
    writeln('Путей из точки ',start,' в ',finish,' = ',cnt);
end.