How to implement the rotation of a two-dimensional vector by 45 degrees, found solutions for 90, 180, 270. Such a sweep can be realized only through the rotation matrix?
Another question regarding the future use of vector elements
int E; cout << " Input E "; cin >> E; for (int y = 0; y < col; ++y) { if ((array[y][y] == (min - E)) || (array[y][y] == (min + E))) { cout << "Element #" << y+1 << ":match "; } else { cout << "Element #" << y + 1 << ":not match "; } } In this case, the values are simply checked for coincidences with the condition (which is logical), but how to realize that the values that are suitable were used for further calculations?