Int inf_fun(char *a,int *b,char *d, int size_d,char* pod,int pod_s)

{

int K_slov = 0, I = 0, DL = 0, K = 0, J;

int N = 0;

while(A[I] != '\0')

{

J = 0;

while(J < size_d)

{

if (A[I] == D[J])

J = size_d;

J = J + 1;

}

if(J == size_d)

{

if(DL <= POD_S && A[I] == POD[DL])

K = K + 1;

DL = DL + 1;

}

else

{

if (DL != 0)

{

B[N+1] = I;

B[N] = I - DL;

N = N + 2;

if(K = POD_S)

K_slov = K_slov + 1;

}

K = 0;

}

I = I + 1;

}

if(DL != 0)

{

A[I] = D[0];

A[I+1] = '\0';

B[N+1] = I;

B[N] = I - DL;

N = N + 2;

}

B[N] = K_slov;

N = N + 1;

return N;

}

void Sort(int *A, int size)

{

int I = 0, J, T1, T2;

for(I;I < size -3;I = I + 2)

{

J = I + 2;

for(J; J < size - 2;J = J + 2)

{

if (A[I+1] - A[I] < A[J+1] - A[J])

{

T1 = A[I+1];

T2 = A[I];

A[I+1] = A[J+1];

A[I] = A[J];

A[J] = T2;

A[J+1] = T1;

}

}

}

}

int _tmain(int argc, _TCHAR* argv[])

{

/*int *S = new int,*S1 = new int,*S3 = new int;

char *D = (char*)malloc(sizeof(char));

cout << endl << "delimiter";

D = create_str(S1);

char *PO = (char*)malloc(sizeof(char));

cout << endl << "podstroka";

PO = create_str(S3);

cout << endl << "TEXT" << endl;

char **T = Ftext(S);

for (int i = 0; i < *S; i++)

{

print(T[i]);

cout << endl << '[' << i << ']' << endl;

int * AAA = (int*)calloc(*S,sizeof(int));

int siz = inf_fun(T[i], AAA,D,*S1,PO,*S3);

for(int j = 0; j < siz; j++)

cout << AAA[j] << ' ';

}*/

int Char

/*int * b = new int;

char *a = create_str(b);

int i = 0;

while(i < *b)

{

cout << a[i];

i++;

}

cout << endl;

i = 0;

while(a[i] != '\0')

cout << a[i++];*/

return 0;

}