while ((s1 = strchr (s1, 0x20)) != NULL)

while ((s1 = strchr (s1, ' ')) != NULL)

#include<iostream>
#include <conio.h>
using namespace std;

void fillarray(int * array[], int m, int n)
{
    for(int i=0;i<m;i++)
    {
        for(int j=0;j<n;j++)
        {
            array[i][j]=rand() % 10; //fill with random value from 0 to 9
            cout<<array[i][j]<<"\t"; //print to screen
        }
    cout<<"\n"; //"\n"=endl
    }
    cout<<endl;
}

void result(int * a[], int * b[], int m, int k, int n)
{
    int sum;
    cout<<"Result "<<m<<"x"<<n<<" array:"<<endl<<endl;

    for(int i=0; i<m; i++)
    {
        for(int j=0; j<n; j++)
        {
            for(int h=0; h<k ;h++)
            {
                sum=sum+a[i][h]*b[h][j]; //matrix multiplication
            }
            cout<<sum<<"\t"; //print to screen
            sum=0;             
        }
        cout<<endl;
    }    
}

int main()
{
    srand(time(NULL));
    int m,n,k;
    
    cout<<"Put first array size: "<<endl<<"m: ";
    cin>>m; cout<<"n: "; cin>>k;
    cout<<"Put second array size: "<<endl<<"m: "<<k<<endl<<"n: ";
    cin>>n; cout<<endl;
    /* allocate memory */
    int**p=new int *[m],**q=new int*[k];
    for (int i=0;i<m;i++) p[i]=new int[k];
    for (int i=0;i<k;i++) q[i]=new int[n];

    fillarray(p,m,k);
    cout<<"*"<<endl<<endl;
    fillarray(q,k,n);
    cout<<"="<<endl<<endl;
    result(p,q,m,k,n);
    /* free memory */
    for (int i=0;i<k;i++) delete p[i];
    for (int i=0;i<n;i++) delete q[i];
    delete[] p, q;

    cout<<endl<<"Press any key..."<<endl;
    getch();
    return 0;
}

#include <stdio.h>
#include <conio.h>
#include <stdlib.h>
#include <time.h>

int const N =3;

int ** func(int **m, int **n)
{
int **v;
int i, j, f, l, h, k;

v = (int**)malloc(sizeof(int) * N);

if(v == NULL)
{
printf("Not ehough memory!\n");
getch();
exit(1);
}

for(i=0; i<N; i++)
{
*(v+i) = (int*)malloc(sizeof(int)*N);

if(*(v+i) == NULL)
{
printf("Not enough memory!\n");
getch();
exit(1);
}
}
i = j = k = h =0;
for (f=0; f<N; f++)
{
for(l=0; l<N; l++)
{
int sum=0, current;
for(j=0,k=0; j<N,k<N; j++,k++)
{
current = *(*(m+i)+j) * *(*(n+k)+h);
sum += current;
}
*(*(v+f)+l) = sum;
h++, j=0, k=0;
}
i++, j=0, k=0, h=0;
}
return v;
}

int main()
{

int **m;
int **n;
int **v;
n = m = (int**)malloc(sizeof(int) * N); // v6deljaem pamat'
int i,j,k,h,f,l;
srand(time(NULL));

for (i=0; i<N; i++){
m[i] = (int*)malloc(sizeof(int)*N);// v6deljaem pamat'
for(j=0; j<N; j++){
m[j] = (int*)malloc(sizeof(int)*N);}}

for (k=0; k<N; k++){
n[k] = (int*)malloc(sizeof(int)*N);// v6deljaem pamat'
for(h=0; h<N; h++){
n[h] = (int*)malloc(sizeof(int)*N);}}

for (i=0; i<N; i++){
for(j=0; j<N; j++){
*(*(m+j)+i) = (rand() % 10) + 1; }} // zapolnjaem matrix

for (i=0; i<N; i++){
for(j=0; j<N; j++){ printf("%d\t", m[i][j]); } printf("\n"); }
printf("\n*\n\n");

for (k=0; k<N; k++){
for(h=0; h<N; h++){
*(*(n+h)+k) = (rand() % 10) + 1; }} // zapolnjaem matrix
for (k=0; k<N; k++){
for(h=0; h<N; h++){ printf("%d\t", n[k][h]); } printf("\n"); }
printf("\n=\n\n");

v = func(m, n);
for (i=0; i<N; i++)
{
for(j=0; j<N; j++)
{
printf("%d\t", *(*(v+i)+j));
}
printf("\n\n");
}
getch ();
return 0;
}