#include #include using namespace std; char* randomCreatArray(int n) { char* a = new char[n*n]; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { if (rand() % 2 == 0) a[i*n + j] = 0; else a[i*n + j] = 1; } } return a; } void printArr(char* a,int n) { for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { if (a[i*n + j] == 0) cout << 0 << " "; else cout << 1 << " "; } cout << endl; } } int* nearElementSeek(char*a, int n, int row, int col) { int x = row; int y = col; int a8t[] = { (x - 1)*n + y - 1,(x - 1)*n + y,(x - 1)*n + y + 1,x*n + y - 1,x*n + y + 1,(x - 1)*n + y - 1,(x - 1)*n + y,(x - 1)*n + y - 1 }; if (x == 0 && y == 0) { int* a3=new int[4]; a3[0] = 1; a3[1] = n; a3[2] = n+1; a3[3] = -1; return a3; } else if (x == 0 && y == n - 1) { int* a3 = new int[4]; a3[0] = n - 2; a3[1] = 2 * n - 2; a3[2] = 2 * n - 1; a3[3] = -1; return a3; } else if (x == n - 1 && y == 0) { int* a3 = new int[4]; a3[0] = (n-2)*n; a3[1] = (n-2)*n+1; a3[2] = (n-1)*n+1; a3[3] = -1; return a3; } else if (x == n - 1 && y == n - 1) { int* a3 = new int[4]; a3[0] = n *(n - 1) - 1; a3[1] = n*(n - 1) - 2; a3[2] = n* n - 2; a3[3] = -1; return a3; } else if (x == 0) { int* a5 = new int[6]; a5[0] = y - 1; a5[1] = y + 1; a5[2] = y - 1 + n; a5[3] = y + n; a5[4] = y + n + 1; a5[5] = -1; return a5; } else if (y == 0) { int* a5 = new int[6]; a5[0] = (x - 1)*n; a5[1] = (x - 1)*n + 1; a5[2] = x*n + 1; a5[3] = (x + 1)*n; a5[4] = (x + 1)*n + 1; a5[5] = -1; return a5; } else if (x == n - 1) { int* a5 = new int[6]; a5[0] = (n - 2)*n - 1; a5[1] = (n - 2)*n; a5[2] = (n - 2)*n + 1; a5[3] = (n - 1)*n - 1; a5[4] = (n - 1)*n + 1; a5[5] = -1; return a5; } else if (y == n - 1) { int* a5 = new int[6]; a5[0] = (x - 1)*n - 2; a5[1] = (x - 1)*n - 1; a5[2] = x*n - 2; a5[3] = (x + 1)*n - 2; a5[4] = (x + 1)*n - 1; a5[5] = -1; return a5; } else { int* a8 = new int[9]; for (int i = 0; i < 8; i++) a8[i] = a8t[i]; a8[8] = -1; return a8; } } int arrLen(int* a) { for (int i = 0;; i++) { if (a[i] == -1) return i; } } bool elementIfInArr(int a,int* b,int b_size) { for (int i = 0; i < b_size; i++) { if (a == b[i]) return true; } return false; } void sameSeek(char* a, int n, int row, int col,int* &all,int* &sk,int& all_count,int & sk_count) { char v = a[row*n + col]; int* b = nearElementSeek(a, n, row, col); int b_lenth = arrLen(b); for (int i = 0; i < b_lenth; i++) { if (!elementIfInArr(b[i], sk,n*n)) { sk[sk_count] = b[i]; sk_count++; if (a[b[i]] == v) { all[all_count] = b[i]; all_count++; sameSeek(a, n, b[i] / n, b[i] % n, all, sk, all_count,sk_count); } } } } void main() { srand(time(0)); int n; cout << "input a integer represent size of array : "; cin >> n; auto arr=randomCreatArray(n); int* sk = new int[n*n]; memset(sk, -1, 4 * n*n); int* all = new int[n*n]; memset(all, -1, 4 * n*n); int sk_count = 0, all_count = 0; cout << "intput two integers represent row and col of a element :"; int row, col; cin >> row; cin >> col; printArr(arr, n); sameSeek(arr, n, row, col, all, sk, all_count, sk_count); int all_len = arrLen(all); cout << "all elements near and same witn given element "<

seek same and neat