C++实现矩阵乘法

最新推荐文章于 2024-01-04 14:54:48 发布

DCLe

最新推荐文章于 2024-01-04 14:54:48 发布

阅读量292

点赞数

分类专栏：数据结构(C&C++) 文章标签： IDEA显示接口继承关系快捷键

本文链接：https://blog.csdn.net/qq_45298704/article/details/125836469

版权

数据结构(C&C++) 专栏收录该内容

23 篇文章 0 订阅

订阅专栏

#include<iostream>
#include<omp.h>
#include<vector>
#include<algorithm>
#define N 3
using namespace std;

void myPrint(int val) {
	cout << val << endl;
}

int main() {
	int a[N][N];
	int b[N][N];
	int c[N][N];
	for (int i = 0; i < N; i++) {
		for (int j = 0; j < N; j++) {
			int num = rand() % 10 + 1;
			a[i][j] = num;
		}
	}
	for (int i = 0; i < N; i++) {
		for (int j = 0; j < N; j++) {
			int num = rand() % 10 + 1;
			b[i][j] = num;
		}
	}


	for (int i = 0; i < N; i++) {
		for (int j = 0; j < N; j++) {
			c[i][j] = 0;
			for (int k = 0; k < N; k++) {
				c[i][j] += a[i][k] * b[k][j];
			}
		}
	}

	for (int i = 0; i < N; i++) {
		for (int j = 0; j < N; j++) {
			cout << a[i][j] << " ";
		}
		cout << endl;
	}
	cout << endl;

	for (int i = 0; i < N; i++) {
		for (int j = 0; j < N; j++) {
			cout << b[i][j] << " ";
		}
		cout << endl;
	}
	cout << endl;

	for (int i = 0; i < N; i++) {
		for (int j = 0; j < N; j++) {
			cout << c[i][j] << " ";
		}
		cout << endl;
	}
}