week 7_inclass

#include <iostream>

using namespace std;

int main()
{

    /*
    int arr[10][10] ;
    int m;
    int n;
    cin>>m>>n;

    for(int i = 0; i<m; i++)
    {
        for (int j = 0; j<n; j++)
        {
            cout<<"arr["<<"] = "<<
            cin>>arr[i][j];
            arr[i][j]+=10;
        }

    }

    for(int i = 0; i<m; i++)
    {
        for (int j = 0; j<n; j++)
        {
            cout<<arr[i][j]<<" ";

        }
        cout<<endl;
    }
*/




   /*
    int arr[10][10];
    int m;
    int n;
    int max_el;
    int min_el;

    cin>>m>>n;
    for (int i = 0; i < m; i++){
        for (int j = 0; j <n; j++){
            cin>>arr[i][j];

        }

    }
    max_el = arr[0][0];
    min_el = arr[0][0];

     for (int i = 0; i < m; i++){
        for (int j = 0; j <n; j++){

            if (max_el<arr[i][j]){
                max_el = arr[i][j];
            }
            if (min_el > arr[i][j]){
                min_el = arr[i][j];
            }

        }

    }
    cout<<"max element: "<<max_el<<endl;
    cout<<"min element: "<<min_el<<endl;
*/



    int arr[10][10];
    int n;
    int sum_ln = 0;
    cin>>n;

    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            cin>>arr[i][j];
        }
    }
    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            cout<<arr[i][j]<<" ";
            sum_ln += arr[i][j];
        }
        cout<<"sum of line: "<<sum_ln<<endl;
        sum_ln = 0;
    }


    sum_ln = 0;

    for (int i = 0; i<n; i++){
        for(int j = 0; j<n; j++){
           sum_ln+=arr[j][i];
        }

    }
     cout<<"sum columns: "<<sum_ln<<endl;
     sum_ln = 0;

      for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++)
        if (i == j){
            sum_ln+= arr[i][j];
        }
      }
      cout<<"sum of prime diagonal: "<<sum_ln<<endl;
        sum_ln = 0;
        for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++)
        if (i > j){
            sum_ln+= arr[i][j];
        }
      }
      cout<<"sum of elements underneath the prime diagonal: "<<sum_ln<<endl;
      sum_ln = 0;

       for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++)
        if (i < j){
            sum_ln+= arr[i][j];
        }
       }
       cout<<"sum of elements above the prime diagonal: "<<sum_ln<<endl;
       sum_ln = 0;

       for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++)
        if (i < j){
            sum_ln+= arr[i][j];
        }
       }
       cout<<"sum of elements above the secondary diagonal: "<<sum_ln<<endl;
       sum_ln = 0;







       return 0;
}