From d19e7fb6c1864e1e912ea0be73af5b6a67db2f4d Mon Sep 17 00:00:00 2001
From: bala <13452927+rfgsdhshgfh@user.noreply.gitee.com>
Date: Sat, 13 Jan 2024 15:28:00 +0000
Subject: [PATCH] =?UTF-8?q?=E6=B1=82=E4=B8=A4=E4=B8=AA=E5=AF=B9=E7=A7=B0?=
 =?UTF-8?q?=E7=9F=A9=E9=98=B5=E4=B9=8B=E5=92=8C=E4=B8=8E=E4=B9=98=E7=A7=AF?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

Signed-off-by: bala <13452927+rfgsdhshgfh@user.noreply.gitee.com>
---
 ...4\344\270\216\344\271\230\347\247\257.cpp" | 81 +++++++++++++++++++
 1 file changed, 81 insertions(+)
 create mode 100644 "2224020152/\347\254\254\345\205\255\345\215\225\345\205\203/\346\261\202\344\270\244\344\270\252\345\257\271\347\247\260\347\237\251\351\230\265\344\271\213\345\222\214\344\270\216\344\271\230\347\247\257.cpp"

diff --git "a/2224020152/\347\254\254\345\205\255\345\215\225\345\205\203/\346\261\202\344\270\244\344\270\252\345\257\271\347\247\260\347\237\251\351\230\265\344\271\213\345\222\214\344\270\216\344\271\230\347\247\257.cpp" "b/2224020152/\347\254\254\345\205\255\345\215\225\345\205\203/\346\261\202\344\270\244\344\270\252\345\257\271\347\247\260\347\237\251\351\230\265\344\271\213\345\222\214\344\270\216\344\271\230\347\247\257.cpp"
new file mode 100644
index 00000000..3248a4bd
--- /dev/null
+++ "b/2224020152/\347\254\254\345\205\255\345\215\225\345\205\203/\346\261\202\344\270\244\344\270\252\345\257\271\347\247\260\347\237\251\351\230\265\344\271\213\345\222\214\344\270\216\344\271\230\347\247\257.cpp"
@@ -0,0 +1,81 @@
+#include <iostream>
+using namespace std;
+
+#define N 4
+#define M 10
+
+static void input(int n, int a[], int b[])
+{
+    for(int k=0;k<n*(n+1)/2;k++){
+        cin>>a[k];
+    }
+    for(int k=0;k<n*(n+1)/2;k++){
+        cin>>b[k];
+    }
+}
+
+static int value(int a[], int i,int j)
+{
+    if (i>=j)
+        return a[i*(i+1)/2+j];
+    else
+        return a[j*(j+1)/2+i];
+}
+
+{
+    for (int i=0;i<N;i++){
+        for(int j=0;j<N;j++){
+            c[i][j]=value(a,i,j)+value(b,i,j);
+        }
+    }
+}
+
+static void mult(int a[],int b[],int c[][N])
+{
+    for (int i=0;i<N;i++){
+        for (int j=0;j<N;j++){
+            int sum = 0;
+            for (int k=0;k<N;k++){
+                sum=sum+value(a,i,k)*value(b,k,j);
+            }
+            c[i][j]=sum;
+        }
+    }
+}
+
+static void disp1(int a[])
+{
+    for (int i=0;i<N;i++){
+        for (int j=0;j<N;j++){
+            cout<<value(a,i,j)<<" ";
+        }
+        cout<<endl;
+    }
+}
+
+static void disp2(int c[][N])
+{
+    for (int i=0;i<N;i++){
+        for (int j=0;j<N;j++){
+            cout<<c[i][j]<<" ";
+        }
+        cout<<endl;
+    }
+}
+
+int main()
+{
+    int n;
+    cin>>n;
+    int a[n*(n+1)/2],b[n*(n+1)/2];
+    int c1[N][N],c2[N][N];
+    input(n,a,b);
+    cout<<"两个矩阵之和"<<endl;
+    madd(a,b,c1);
+    disp2(c1);
+    cout<<"两个矩阵之积"<<endl;
+    mult(a,b,c2);
+    disp2(c2);
+    return 0;
+}
+
-- 
Gitee