#include<stdio.

h>
#include<conio.h>
main()
{
int i,j,k,n,m;
printf("\nEnter the order of the square matrix::\t");
scanf("%d",&n);
{
float a[n][2*n],b[n][2*n],r,c;
for(i=0;i<n;i++)
{
printf("\nEnter %d Row elements :\n",i+1);
for(j=0;j<n;j++)
{
scanf("%f",&a[i][j]);
}
}
for(i=0;i<n;i++)
for(j=n;j<(2*n);j++)
{
if(j==(i+n))
a[i][j]=1;
else
a[i][j]=0;
}
for(i=0;i<n;i++)
for(j=0;j<(2*n);j++)
b[i][j]=a[i][j];
for(k=0;k<n-1;k++)
for(i=k+1;i<n;i++)
{
r=a[i][k]/a[k][k];
for(j=0;j<(2*n);j++)
a[i][j]=a[i][j]-(r*a[k][j]);
}
for(k=n-1;k>0;k--)
for(i=k-1;i>=0;i--)
{
r=a[i][k]/a[k][k];
for(j=0;j<(2*n);j++)
a[i][j]=a[i][j]-(r*a[k][j]);
}
for(i=0;i<n;i++)
{
c=a[i][i];
for(j=0;j<(2*n);j++)
a[i][j]=a[i][j]/c;
}
printf("\nInverse of the given matrix found using Guass Jordan method is:");
for(i=0;i<n;i++)
{
printf("\n\n");
for(j=n;j<(2*n);j++)
printf("\t%f",a[i][j]);
}
}
getch();
}