标签：aa return matrix jz int 代码 矩阵 ++ CPP

矩阵的计算

C实现

#include <stdio.h>
#define N 100
typedef struct matrix
{
	int h, w, aa[N][N];
	//h:长 ， w:宽,  aa 矩阵
} jz;
void initjz(jz *a, int x, int y) //初始化,行x列y,全部0
{
	a->h = x, a->w = y;
	for (int i = 0; i < x; i++)
		for (int j = 0; j < y; j++)
			a->aa[i][j] = 0;
}
jz jz_cheng(jz x, jz y) //返回x*y
{
	jz s;
	initjz(&s, x.h, y.w);
	for (int i = 0; i < x.h; i++)
		for (int j = 0; j < y.w; j++)
			for (int k = 0; k < x.w; k++)
				s.aa[i][j] += x.aa[i][k] * y.aa[k][j];
	return s;
}
jz jz_jia(jz x, jz y) //返回x+y
{
	jz s;
	initjz(&s, x.h, x.w);
	for (int i = 0; i < s.h; i++)
		for (int j = 0; j < s.w; j++)
			s.aa[i][j] = x.aa[i][j] + y.aa[i][j];
	return s;
}
jz jz_jian(jz x, jz y) //返回x-y
{
	jz s;
	initjz(&s, x.h, x.w);
	for (int i = 0; i < s.h; i++)
		for (int j = 0; j < s.w; j++)
			s.aa[i][j] = x.aa[i][j] - y.aa[i][j];
	return s;
}
jz jz_chengf(jz a, int k) //返回a的k次
{
	if (k == 1)
		return a;
	jz aa = jz_chengf(a, k / 2);
	aa = jz_cheng(aa, aa);
	if (k % 2 != 0)
		return jz_cheng(aa, a);
	else
		return aa;
}
jz jz_mod(jz x, int m) //返回整体mod
{
	jz s;
	initjz(&s, x.h, x.w);
	for (int i = 0; i < s.h; i++)
		for (int j = 0; j < s.w; j++)
			s.aa[i][j] = x.aa[i][j] % m;
	return s;
}
void jz_cpy(jz *a, jz b)//复制到
{
	a->h = b.h;
	a->w = b.w;
	for (int i = 0; i < a->h; i++)
		for (int j = 0; j < a->w; j++)
			a->aa[i][j] = b.aa[i][j];
	return;
}
int main()
{
	jz a, b;
	initjz(&a, 23, 31);
	b = a; //或jz_cpy(&b,a);
	jz c = jz_jia(a, b);
	return 0;
}

CPP实现

#include <bits/stdc++.h>
using namespace std;
constexpr int N = 100;
typedef struct matrix
{
	int h, w, aa[N][N];
	matrix() {}
	matrix(int x, int y) : h(x), w(y)
	{
		for (int i = 0; i < x; i++)
			for (int j = 0; j < y; j++)
				aa[i][j] = 0;
	}
	friend matrix operator*(matrix x, matrix y)
	{
		matrix s(x.h, y.w);
		for (int i = 0; i < x.h; i++)
			for (int j = 0; j < y.w; j++)
				for (int k = 0; k < x.w; k++)
					s.aa[i][j] += x.aa[i][k] * y.aa[k][j];
		return s;
	}
	friend matrix operator+(matrix x, matrix y)
	{
		matrix s(x.h, x.w);
		for (int i = 0; i < s.h; i++)
			for (int j = 0; j < s.w; j++)
				s.aa[i][j] = x.aa[i][j] + y.aa[i][j];
		return s;
	}
	friend matrix operator-(matrix x, matrix y)
	{
		matrix s(x.h, x.w);
		for (int i = 0; i < s.h; i++)
			for (int j = 0; j < s.w; j++)
				s.aa[i][j] = x.aa[i][j] - y.aa[i][j];
		return s;
	}
	friend matrix operator^(matrix a, int k) //bushi xor
	{//是乘方,不是XOR
		if (k == 1)
			return a;
		matrix aa = a ^ (k / 2);
		aa = aa * aa;
		if (k % 2 != 0)
			return aa * a;
		else
			return aa;
	}
	friend matrix operator%(matrix a, int k)
	{
		for (int i = 0; i < a.h; i++)
			for (int j = 0; j < a.w; j++)
				a.aa[i][j] %= k;
		return a;
	}
} jz;
jz a;
int main()
{

	return 0;
}

标签：aa,return,matrix,jz,int,代码,矩阵,++,CPP
来源： https://www.cnblogs.com/ssj233-aaa/p/16366234.html

本站声明： 1. iCode9 技术分享网（下文简称本站）提供的所有内容，仅供技术学习、探讨和分享；
2. 关于本站的所有留言、评论、转载及引用，纯属内容发起人的个人观点，与本站观点和立场无关；
3. 关于本站的所有言论和文字，纯属内容发起人的个人观点，与本站观点和立场无关；
4. 本站文章均是网友提供，不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属；如您发现该文章侵犯了您的权益，可联系我们第一时间进行删除；
5. 本站为非盈利性的个人网站，所有内容不会用来进行牟利，也不会利用任何形式的广告来间接获益，纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。