Summary Files Commits Branches @commit @diff @stats
path: root / Year 1 / Programming introduction / Exams / Exam2 / prob2.cpp
blob: 72cb50e2454c47fdab637d3bd55d12bfe06f1e19 (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
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;
}