метод Жордано-Гаусса

#include <cstdlib>
#include <iostream>
#include <fstream>
#include <math.h>
using namespace std;
 
int main()
{double ka,kb,tempa,tempb;
int n=0;
int i=0;
int j=0;
int p;
int m;
bool flag=false;
int e=2;
int s=0;
char str;
double m1;
ifstream in_num;
ifstream in_num1;
in_num1.open ("inputnum.txt");
while (!in_num1.eof())
{in_num1>>m1;
n++;
}
while (!in_num1.eof())
{in_num1>>str;
m=(int)str;
if ((m==47)||(m<45)||(m>57))
flag=true;
}   
in_num1.close();
if (flag==true)
{
cout << "Incorrect input";
system("PAUSE");
return EXIT_SUCCESS;
}
in_num1.close();
m=0;
n=n/2;
while (n>0)
{n=n-e;
e=e+2;
m++;
}
n=m;
m++;
m=m*2;
double a[n][m];
double c[n*2];
in_num.open ("inputnum.txt");
while (!in_num.eof())
{if (j<m)
{in_num>>a[i][j];
in_num>>a[i][j+1];
j+=2;
}
else
{j=0;
i++;
}
}
in_num.close();
for (i=0;i<n-1;i++) 
{for (j=0;j<n;j++)
{if (j!=i)
ka=(a[j][s]*a[i][s]+a[j][s+1]*a[i][s+1])/(a[i][s]*a[i][s]+a[i][s+1]*a[i][s+1]);
kb=(a[i][s]*a[j][s+1]-a[i][s+1]*a[j][s])/(a[i][s]*a[i][s]+a[i][s+1]*a[i][s+1]);
for (p=0;p<m;p+=2)
{tempa=ka*a[i][p]-kb*a[i][p+1];
tempb=ka*a[i][p+1]+kb*a[i][p];
a[j][p]=a[j][p]-tempa;
a[j][p+1]=a[j][p+1]-tempb;
}
}
s+=2;
}
s=0;
for (i=0;i<n;i++)
{c[s]=(a[i][m-2]*a[i][s]+a[i][m-1]*a[i][s+1])/(a[i][s]*a[i][s]+a[i][s+1]*a[i][s+1]);
c[s+1]=(a[i][s]*a[i][m-1]-a[i][s+1]*a[i][m-2])/(a[i][s]*a[i][s]+a[i][s+1]*a[i][s+1]);
s+=2;
}
for (i=0;i<m-2;i+=2)
cout<<"x"<<i/2+1<<"="<<c[i]<<"+"<<c[i+1]<<"i"<<'\n';
 
    system("PAUSE");
    return EXIT_SUCCESS;
}