Помогите написать алгоритм

начиная со строчки return AiBi;

#include

#include

#define nmax 3

bool isIncludedAtoB(int *A[], int nA, int *B[], int nB)

{

bool AiBi = true;

int i=0,j,k;

for (i=0;i
{

for (j=0;j
{

AiBi = true;

for (k=0;k
{

if (A[i][k] != B[j][k])

{

AiBi = false;

break;

}

}

if (AiBi)

{

// A[i] into B

// выход из цикла по j

break;

}

}

if ((!AiBi)&&(j == nB))

{

// A not subset of B

break;

}

}

return AiBi;

}

int main()

{

bool AintoB = true;

int nA = 3;

int nB = 8;

int i,j;

int A[] = {0, 0, 1, 0, 1, 0, 0, 1, 1};

int B[] = {0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1};

int *pA[3];

int *pB[8];

pA[0] = A;

for (i=1; i
pA[i] = pA[i-1] + nmax;

pB[0] = B;

for (i=1; i
pB[i] = pB[i-1] + nmax;

printf("set of A:\n");

for (i=0; i
{

for (j=0; j < nmax; j++)

printf("%d ",pA[i][j]);

printf("\n");

}

printf("set of B:\n");

for (i=0; i
{

for (j=0; j < nmax; j++)

printf("%d ",pB[i][j]);

printf("\n");

}

printf("Is set A included into set B?\n");

AintoB = isIncludedAtoB(pA,nA,pB,nB);

if (AintoB)

printf("\nset A is subset of set B");

else

printf("\nset A is not subset of set B");

_getch();

return 0;

}