// Created by AZTECCO // edited by AZTECCO for Robin Rademaker #include #include template // QUESTION: What kind of template is this? void diagonalsSumOfSquareArray( const int( &arr )[ sideLength ][ sideLength ] ){ int diagonalSumFromTopRight = 0; int diagonalSumFromTopLeft = 0; // always choose for self-descriptive // code instead of comments for ( std::size_t i = 0 ; i < sideLength ; ++i ){ // indentation by 1 bcz from a phone diagonalSumFromTopLeft += arr[ i ][ i ]; diagonalSumFromTopRight += arr[ i ][ sideLength - i - 1 ]; } std::cout<< "diagonalSumFromTopLeft : " << diagonalSumFromTopLeft << std::endl << "diagonalSumFromTopRight : " << diagonalSumFromTopRight << std::endl; } // here we have to declare the size const // to use in the array declaration const std::size_t sample_01_sideLength = 3; int sample_01[ sample_01_sideLength ][ sample_01_sideLength ] = { { 9, 1, 2 }, { 1, 10, 1 }, { 3, 1, 5 } }; const std::size_t sample_02_sideLength = 5; int sample_02[ sample_02_sideLength ][ sample_02_sideLength ] = { { 9, 1, 1, 1, 2 }, { 1, 1, 1, 1, 1 }, { 1, 1, 1, 1, 1 }, { 1, 1, 1, 1, 1 }, { 3, 1, 1, 1, 5 } }; // here we use two templates because // this func just prints a 2d array of // any shape template void printArr( int(&arr)[R][C] ){ std::cout << "\n\n[*] Multi-dimensional array with diagonal sum\n\n"; for( std::size_t i = 0 ; i < R ; ++i ){ std::cout << "Row " << i + 1 << ": "; for( std::size_t j = 0 ; j < C ; ++j ){ std::cout.fill(' '); // i prefer a space std::cout << std::setw(2) << arr[i][j] << " "; } std::cout<< std::endl ; } } int main(){ // when accessing global data indicate it // using scope resolution :: printArr( ::sample_01 ); diagonalsSumOfSquareArray( ::sample_01 ); printArr( ::sample_02 ); diagonalsSumOfSquareArray( ::sample_02 ); // note how the main program is clear and // tidy // it's easy to see what happens return 0; }

Azzteco arrays