8, 9, 10 tasks are done

2025.03.21/09Ex/solve.c

@@ -0,0 +1,45 @@
+#include "solve.h"
+#include <math.h>
+
+#define eps 1e-17
+
+int t9_solve(double *a, int m, int n)
+{
+	int max_i = 0, max_j = 0;
+	double maximum = 0;
+
+	for (int j = 0; j < n; j++)
+		for (int i = 0; i < m; i++)
+		{
+			double sum_i = 0;
+			double sum_j = 0;
+			double aij = a[i*n + j];
+			
+			for (int k = 0; k < n; k++) if (k != j)
+				sum_i += fabs(a[i*n + k] - aij);
+
+			for (int k = 0; k < m; k++) if (i != k)
+				sum_j += fabs(a[k*n + j] - aij);
+			
+			if (((sum_j + sum_i) - maximum) > eps)
+				maximum = (sum_j + sum_i), max_i = i, max_j = j;
+		}
+
+	for (int l = max_j+1, del_j = 1; l < max_i*n; l++)
+	{
+		if (l == ((n * del_j) + max_j))
+			del_j++;
+		else 
+			a[l - del_j] = a[l];
+	}
+
+	for (int l = (max_i+1)*n, del_j = max_i; l < m*n; l++)
+	{
+		if (l == ((n * (del_j + 1)) + max_j))
+			del_j++;
+		else 
+			a[l - del_j - n] = a[l];
+	}
+
+	return max_i * n + max_j;
+}