Решение СЛАУ методом прогонки

#include<stdio.h>
#include<conio.h>
main(){
int N;
printf("Vvedite kol-vo uravnenii: ");
scanf("%d",&N);
int i;
float A[N],B[N],C[N],D[N],P[N],Q[N],X[N];
 
for(i=1;i<N;i++){
printf("a%d = ",i+1);
scanf("%f",&A[i]);}
 
for(i=0;i<N;i++){
printf("b%d = ",i+1);
scanf("%f",&B[i]);}
 
for(i=0;i<N-1;i++){
printf("c%d = ",i+1);
scanf("%f",&C[i]);}
 
for(i=0;i<N;i++){
printf("d%d = ",i+1);
scanf("%f",&D[i]);}
 
P[0]=-(C[0]/B[0]);
printf("P[1] = %f\n",P[0]);
Q[0]=D[0]/B[0];
printf("Q[1] = %f\n",Q[0]);
 
for(i=1;i<N-1;i++){
P[i]=-C[i]/(B[i]+A[i]*P[i-1]);
printf("P[%d] = %f\n",i+1,P[i]);
Q[i]=(D[i]-A[i]*Q[i-1])/(B[i]+A[i]*P[i-1]);
printf("Q[%d] = %f\n",i+1,Q[i]);}
 
X[N-1]=(D[N-1]-A[N-1]*Q[N-2])/(B[N-1]+A[N-1]*P[N-2]);
printf("X[%d] = %f\n",N,X[N-1]);
 
for(i=N-1;i>0;i--){
X[i-1]=P[i-1]*X[i]+Q[i-1];
printf("X[%d] = %f\n",i,X[i-1]);}
 
getch();}

#include "stdafx.h"
#include "conio.h"
#include "math.h"
#include "iostream"
using namespace std;
 
int i,n,k,n1; 
double z;
double A[50][50];
double B[50]; 
double eps[50];
double X[50]; 
double et[50];
 
int main()
{
cout<<"Vvedite razmernost matrici: ";
cin>>n1;
 
cout<<"Vvedite "<<n1<<" strok po "<<n1<<" 4isel:"<<endl;
for (i=0;i<n1;i++)
    for (k=0;k<n1;k++)
        cin>>A[i][k];
 
cout<<"Matrix A:"<<endl;
for (i=0;i<n1;i++)
    {
    for (k=0;k<n1;k++)
        cout<<A[i][k]<<"\t ";
    cout<<endl;
    }
 
cout<<"Vvedite "<<n1<<" 4isel:"<<endl;
for(i=0;i<n1;i++)
    cin>>B[i];
 
cout<<"Matrix B:"<<endl;
for (i=0;i<n1;i++)
    cout<<B[i]<<endl;
 
n=n1-1;
eps[0]=-A[0][1]/A[0][0];
et[0]=B[0]/A[0][0];
 
for(i=1;i<n;i++)
    {
    z=A[i][i]+A[i][i-1]*eps[i-1];
    eps[i]=-A[i][i+1]/z;
    et[i]=(B[i]-A[i][i-1]*et[i-1])/z;
    }
 
X[n]=(B[n]-A[n][n-1]*et[n-1])/(A[n][n]+A[n][n-1]*eps[n-1]);
 
for(i=n-1;i>=0;i--)
    X[i]=eps[i]*X[i+1]+et[i];
 
cout<<"Matrix X:"<<endl;
for(i=0;i<n1;i++)
    cout<<X[i]<<endl;
 
getch();
return 0;
}