/*While using this method bool var(int *arr,int r,int c); array element can be accessed by using logic *(arr + i*c + j) //only just arr skips the bytes forward Other methods may require bound dimensions may led to declaration of const global vars...... */ /* Test these input 3 2 7 6 9 5 1 4 3 8 ============================ 4 8 11 14 1 13 2 7 12 3 16 9 6 10 5 4 15 */ #include #include #include using namespace std; bool row_sum(int *arr,int,int,int &r_sum); bool col_sum(int *arr,int,int); bool dia_sum(int *arr,int,int); int main(){ //Get the size of square matrix to be created int size{}; cin >> size; int matrix[size][size]; //2D matrix int r_sum{}; //input elements for(int i{0} ; i < size ; i++){ for(int j{0} ; j < size ; j++){ cin >> matrix[i][j]; } } //using range based for loop to print the 2D array cout << "\n============================" << endl; for(auto &row: matrix){ cout << "[ "; for(auto element: row) cout << element << " "; cout << "]"< sum{}; int add{}; for(int i{} ; i < size1 ; i++){ for(int j{} ; j < size2 ; j++) add+=*(arr+i*size2+j); sum.push_back(add); add = 0; } int check{sum.at(0)}; for(auto n: sum) if(n!=check) return false; r_sum = check; return true; } bool col_sum(int *arr,int size1,int size2){ vector sum{}; int add{}; for(int j{0}; j< size2 ; j++){ for(int i{0}; i< size1 ; i++) add+=*(arr+i*size2+j); sum.push_back(add); add = 0; } int check{sum.at(0)}; for(auto n: sum) if(n!=check) return false; return true; } bool dia_sum(int *arr,int size1,int size2) { vector sum{}; int add{},i{},j{},k{},l{}; for(i = size1-1,j=0; i>=0 && j< size2 ; i--,j++) //wunsused `,` operator in place of && add+=*(arr+i*size2+j); sum.push_back(add); add = 0; for(k = 0 , l = 0; k

magic_sq