arr

#include <stdio.h>

#define N 5

int main()
{
    int flag,in_word,counter,t,min,sum,i,j,k,kk,oi,oj,arr[N][N]={1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16};

    int targ_i,targ_j,max_i,max_j,max_value=0;
    max_i=max_j=0;
    int arr5[N][N]={9,10,20,40,70,10,99,30,50,80,20,30,999,60,90,40,50,60,9999,100,70,80,90,100,99999};
    flag = 1;
    for(i=0;i<N;i++)//print matrix
    {
        for(j=0;j<N;j++)
            printf("%d\t",arr5[i][j]);
        printf("\n");
    }

    for(i=0;i<N;i++)//is matrix simmetrical?
    {
        for(j=0;j<N;j++)
            if(arr5[i][j]!=arr5[j][i])
                flag=0,i=j=N;
    }
    printf("\nmatrix is %s\n\n",flag?"simmetrical":"non simmetrical");

    for(i=0;i<N;i++)//find max in main diagonal
    {
        if(arr5[i][i]>max_value)
        {
            max_value= arr5[i][i];
            max_i = i;
            max_j = i;
        }
    }

    for(i=0;i<N;i++)//find max in main diagonal
    {
        if(arr5[i][N-i-1]>max_value)
        {
            max_value= arr5[i][N-i-1];
            max_i = i;
            max_j = j;
        }
    }

    //swap arr5[max_i][max_j] and arr5[N/2][N/2]
    printf("swap %d and %d now\n",arr5[N/2][N/2],arr5[max_i][max_j]);
        t=arr5[max_i][max_j];
    arr5[max_i][max_j]= arr5[N/2][N/2];
    arr5[N/2][N/2]=t;

    for(i=0;i<N;i++)//print matrix
    {
        for(j=0;j<N;j++)
            printf("%d\t",arr5[i][j]);
        printf("\n");
    }

    return 0;
}