Added my work from todays up exam

1 files changed, 60 insertions, 0 deletions

diff --git a/Year 1/Programming introduction/Exams/Exam2/prob2.cpp b/Year 1/Programming introduction/Exams/Exam2/prob2.cpp
new file mode 100644
index 0000000..72cb50e
--- /dev/null
+++ b/Year 1/Programming introduction/Exams/Exam2/prob2.cpp
@@ -0,0 +1,60 @@
+#include <iostream>
+
+const int MAX_SIZE = 30;
+
+bool hasRepeatedDigits(int n) {
+	for (int lastDigit = 0; n != 0; n /= 10) {
+		lastDigit = n % 10;
+		for (int tmp = n / 10; tmp != 0; tmp /= 10) {
+			if (tmp % 10 == lastDigit)
+				return true;
+		}
+	}
+	return false;
+}
+
+int getRepeatedLen(int matrix[MAX_SIZE][MAX_SIZE], int n) {
+	int arrSize = 0;
+	for (int col = 0, row = n - 1; col < n && row < n; col = (row > 0) ? 0 : col + 1, row = (row > 0) ? row - 1 : 0) {
+		for (int k = col, l = row; k < n && l < n; k++, l++) {
+			if (hasRepeatedDigits(matrix[l][k]))
+				arrSize++;
+		}
+	}
+	return arrSize;
+}
+
+int* collect(int matrix[MAX_SIZE][MAX_SIZE], int n) {
+	int arrSize = getRepeatedLen(matrix, n);
+	int *arr = new int[arrSize];
+
+	for (int col = 0, row = n - 1, arrI = 0; col < n && row < n; col = (row > 0) ? 0 : col + 1, row = (row > 0) ? row - 1 : 0) {
+		for (int k = col, l = row; k < n && l < n; k++, l++) {
+			if (hasRepeatedDigits(matrix[l][k]))
+				arr[arrI++] = matrix[l][k];
+		}
+	}
+
+	return arr;
+}
+
+int main() {
+	int n;
+	std::cin >> n;
+
+	int matrix[MAX_SIZE][MAX_SIZE];
+	for (int i = 0; i < n; i++) {
+		for (int j = 0; j < n; j++)
+			std::cin >> matrix[i][j];
+	}
+
+	int *repeated = collect(matrix, n);
+	int repeatedLen = getRepeatedLen(matrix, n); // По условие няма как иначе да върнем размера
+
+	for (int i = 0; i < repeatedLen; i++) {
+		std::cout << repeated[i] << " ";
+	}
+	std::cout << std::endl;
+
+	delete[] repeated;
+}