local

Author: mostafa-saad

18-Programming-4kids/12_homework_1_answer.cpp

@@ -0,0 +1,36 @@
+#include<iostream>
+using namespace std;
+
+int main() {
+	int arr[100][100];
+	int n, m;
+
+	cin >> n >> m;
+	for (int i = 0; i < n; ++i) {
+		for (int j = 0; j < m; ++j) {
+			cin >> arr[i][j];
+		}
+	}
+
+	int q;
+	cin >> q;
+
+	while (q--) {
+		int r1, r2;
+		cin >> r1 >> r2;
+		r1--;
+		r2--;
+
+		bool is_smaller = true;
+		for (int j = 0; j < m; ++j)
+			is_smaller &= (arr[r1][j] < arr[r2][j]);
+
+		if (is_smaller)
+			cout << "YES\n";
+		else
+			cout << "NO\n";
+	}
+
+	return 0;
+}
+

18-Programming-4kids/12_homework_2_answer.cpp

@@ -0,0 +1,24 @@
+#include<iostream>
+using namespace std;
+
+int main() {
+	int n, upper = 0, lower = 0, val;
+	// No need to create matrix!
+	cin >> n;
+	for (int i = 0; i < n; ++i) {
+		for (int j = 0; j < n; ++j) {
+			cin >> val;
+
+			if (i <= j)
+				lower += val;
+
+			if (i >= j)
+				upper += val;
+		}
+	}
+	cout << upper << "\n";
+	cout << lower << "\n";
+
+	return 0;
+}
+

18-Programming-4kids/12_homework_3_answer.cpp

@@ -0,0 +1,47 @@
+#include<iostream>
+using namespace std;
+
+int main() {
+	int arr[100][100];
+	int n, m;
+
+	cin >> n >> m;
+	for (int i = 0; i < n; ++i)
+		for (int j = 0; j < m; ++j)
+			cin >> arr[i][j];
+
+	//{ d, r,  u,  l, ul, dr, ur, dl };
+	int di[8] = { 1, 0, -1, 0, -1, 1, -1, 1 };
+	int dj[8] = { 0, 1, 0, -1, -1, 1, 1, -1 };
+
+	for (int i = 0; i < n; ++i) {
+		for (int j = 0; j < m; ++j) {
+			bool valid_mountain = true;	// if no neighbors, will remain true!
+
+			// check the 8 neighbors using dir array
+			for (int d = 0; d < 8 && valid_mountain; ++d) {
+				int ni = i + di[d];
+				int nj = j + dj[d];
+
+				if (ni < 0 || nj >= n || nj < 0 || nj >= m)
+					continue;	// outside borders
+
+				valid_mountain &= (arr[i][j] > arr[ni][nj]);
+			}
+
+			if (valid_mountain)
+				cout << i << " " << j << "\n";
+		}
+	}
+
+	return 0;
+}
+/**
+important test
+1 1
+1
+
+answer
+0 0
+ */
+

18-Programming-4kids/12_homework_6_answer.cpp

@@ -0,0 +1,40 @@
+#include<iostream>
+using namespace std;
+
+int main() {
+	int arr1[100][100];
+	int arr2[100][100];
+	int n, m;
+
+	cin >> n >> m;
+	for (int i = 0; i < n; ++i)
+		for (int j = 0; j < m; ++j)
+			cin >> arr1[i][j];
+
+	for (int i = 0; i < n; ++i)
+		for (int j = 0; j < m; ++j)
+			arr2[j][i] = arr1[i][j];
+
+	for (int i = 0; i < m; ++i) {
+		for (int j = 0; j < n; ++j)
+			cout << arr2[i][j] << " ";
+		cout << "\n";
+	}
+
+	return 0;
+}
+/**
+
+3 4
+8 16 9 52
+3 15 27 6
+14 25 29 10
+
+output
+8 3 14
+16 15 25
+9 27 29
+52 6 10
+
+
+ */

18-Programming-4kids/12_homework_8_answer.cpp

@@ -0,0 +1,56 @@
+#include<iostream>
+using namespace std;
+
+int main() {
+	bool is_prime[100][100] = { 0 };
+	int n, m, val;
+
+	cin >> n >> m;
+	for (int i = 0; i < n; ++i)
+		for (int j = 0; j < m; ++j) {
+			cin >> val;
+
+			// let's compute is prime once NOT with every query. Also no need for main array
+			if (val <= 1)
+				continue;
+
+			is_prime[i][j] = 1;
+			for (int k = 2; k < val; ++k) {
+				if (val % k == 0) {
+					is_prime[i][j] = 0;
+					break;
+				}
+			}
+		}
+
+	int q, si, sj, rs, cls;
+	cin >> q;
+
+	while (q--) {
+		cin >> si >> sj >> rs >> cls;
+		int cnt = 0;
+
+		for (int i = si; i <= si + rs - 1; ++i)
+			for (int j = sj; j <= sj + cls - 1; ++j)
+				cnt += is_prime[i][j];
+
+		cout << cnt << "\n";
+	}
+
+	return 0;
+}
+/**
+
+ 3 4
+ 8 16 9 52
+ 3 15 27 6
+ 14 25 29 10
+
+ output
+ 8 3 14
+ 16 15 25
+ 9 27 29
+ 52 6 10
+
+
+ */