From 0996e05988b5d38faba0f616f06e6dcc7466930e Mon Sep 17 00:00:00 2001
From: Syndamia <kamen@syndamia.com>
Date: Sun, 3 Dec 2023 13:33:32 +0200
Subject: [w6] Added solutions for ex1 and ex2 with partials for ex3 and 4

---
 week06/ex1.cpp | 41 +++++++++++++++++++++++++++++++++++++++++
 1 file changed, 41 insertions(+)
 create mode 100644 week06/ex1.cpp

(limited to 'week06/ex1.cpp')

diff --git a/week06/ex1.cpp b/week06/ex1.cpp
new file mode 100644
index 0000000..36938b7
--- /dev/null
+++ b/week06/ex1.cpp
@@ -0,0 +1,41 @@
+#include <iostream>
+
+int main() {
+	// Вход
+	size_t N, M;
+	std::cin >> N >> M;
+
+	int matrix1[60][60], matrix2[60][60];
+	/* При matrix1[i][j] няма значение дали i се води ред или стълб, важното е да
+	 * изберете едно значение и то да си стои до края на задачата.
+	 */
+	for (size_t row = 0; row < N; row++) {
+		for (size_t col = 0; col < M; col++) {
+			std::cin >> matrix1[row][col];
+		}
+	}
+
+	for (size_t row = 0; row < M; row++) {
+		for (size_t col = 0; col < N; col++) {
+			std::cin >> matrix2[row][col];
+		}
+	}
+
+	// Умножение
+	int multMatrix[60][60] = { { 0 } };
+	for (size_t row = 0; row < N; row++) {
+		for (size_t col = 0; col < N; col++) {
+			for (size_t i = 0; i < 60; i++) {
+				multMatrix[row][col] += matrix1[row][i] * matrix2[i][col];
+			}
+		}
+	}
+
+	// Изход
+	for (size_t row = 0; row < N; row++) {
+		for (size_t col = 0; col < N; col++) {
+			std::cout << multMatrix[row][col] << " ";
+		}
+		std::cout << std::endl;
+	}
+}
-- 
cgit v1.2.3