{

for (int i = 0; i < M; ++i)

{

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

{

C[i * N + j] = 0.0;

for (int k = 0; k < K; ++k)

{

C[i * N + j] += A[i * K + k] * B[k * N + j];

}

}

}

int result = 0;

int n = binaryVec.size();

for (int i = 0; i < n; ++i) {

result = (result << 1) | binaryVec[i]; // Left-shift result and add the next bit

}

return result;

int n = vec.size();

// Initialize the result vector with zeros

vector<int> result(n, 0);

// Perform vector-matrix multiplication

for (int i = 0; i < n; i++) {

for (int j = 0; j < n; j++) {

result[i] += vec[j] * mat[j][i];

}

}

return result;

}