#include <stdio.h>
int isSymmetric(int a[10][10],int,int);
int count;
int main() {
int a[10][10],b[4][4],r,c,i,j;
printf("enter numbers\n");
scanf("%d%d",&r,&c);
if (r!=c)
{
    printf("Symmetric is not possible\not");
}
else
{
    printf("\n Enter %d values of a:\n",r*c);
for(i=1;i<=r;i++)
{
 for(j=1;j<=c;j++)
  {
    scanf("%d",&a[i][j]);     
  }
}
for(i=1;i<=r;i++)
{
 for(j=1;j<=c;j++)
  {
    printf("%d\t",a[i][j]);     
  }
  printf("\n");
}
  count=isSymmetric(a,r,c);
 if(count==1)
 {
     printf("Matrix is  symmetric");
 }
 else
 {
     printf("\n not symmetric");
 }
return 0;
}}
int isSymmetric(int a[10][10],int r,int c)
{
int b[4][4],i,j,sim;
 for(i=1;i<=r;i++)
{
 for(j=1;j<=c;j++)
  {
      b[j][i]=a[i][j];
        
  }
}
printf("transpose of given matrix\n");
for(i=1;i<=c;i++)
{
 for(j=1;j<=r;j++)
  {
    printf("%d\t",b[i][j]);     
  }
  printf("\n");
}

for(i=1;i<=c;i++)
{
 for(j=1;j<=r;j++)
 {
   if (a[i][j]==b[i][j])
 {
     count=1;
     goto x;
 }
 }}
 x:return count;
 }