OpenMP矩阵乘法问题

#include <stdio.h>
#include <stdlib.h>
#include <omp.h>

#define N 1000

void multiply(double A[N][N], double B[N][N], double C[N][N]) {
    int i, j, k;

    #pragma omp parallel for private(i, j, k) shared(A, B, C)
    for (i = 0; i < N; i++) {
        for (j = 0; j < N; j++) {
            C[i][j] = 0;
            for (k = 0; k < N; k++) {
                C[i][j] += A[i][k] * B[k][j];
            }
        }
    }
}

int main() {
    double A[N][N], B[N][N], C[N][N];
    // 初始化矩阵A和B
    // ...

    double start_time = omp_get_wtime();
    multiply(A, B, C);
    double end_time = omp_get_wtime();

    printf("Time taken: %f seconds\n", end_time - start_time);

    return 0;
}