가우스 소거법 프로그래밍 해오라는건데 하.. 뭐 복학하고 암것도 기억이안나서

 

그래도 최대한 찾아는 봤는데 .. .이게 왜 실행이 안돼는걸까...

 

벼랑끝까지 몰렸어... 진자 불쌍히여겨줘..

 

#include<iostream.h>
#include<stdio.h>
#include<conio.h>
#include<math.h>
int main()
{
    int n,i,j,k,temp;
    float a[10][10],c,d[10]={0};
    clrscr();
    cout<<"No of equation ? ";
    cin>>n;
    cout<<"Coefficient of all : \n";
    for(i=0;i<n;i++)
    {
        cout<<"equation: "<<i+1<< "   ";
        for(j=0;j<=n;j++)
            cin>>a[i][j];
    }
    for(i=n-1;i>0;i--)        // partial pivoting
    {
        if(a[i-1][0]<a[i][0])
            for(j=0;j<=n;j++)
            {
                c=a[i][j];
                a[i][j]=a[i-1][j];
                a[i-1][j]=c;
            }
    }
    //*************** DISPLAY MATRIX*************//
    for(i=0;i<n;i++)
    {
        for(j=0;j<=n;j++)
            printf("%6.1f",a[i][j]);
        printf("\n");
    }
    //********* changing to upper triangular matrix*************//
    //********* Forward elimination process**************//
    for(k=0;k<n-1;k++)
        for(i=k;i<n-1;i++)
        {
            c= (a[i+1][k]/a[k][k]) ;
           
            for(j=0;j<=n;j++)
                a[i+1][j]-=c*a[k][j];
        }

     // ************DISPLAYING UPPER TRIANGULAE MATRIX***************//

    printf("\n\n");
    for(i=0;i<n;i++)
    {
        for(j=0;j<=n;j++)
            printf("%6.1f",a[i][j]);
           
        printf("\n");
    }
    //***************** Backward Substitution method****************//

    for(i=n-1;i>=0;i--)
    {
        c=0;
        for(j=i;j<=n-1;j++)
            c=c+a[i][j]*d[j];
           
        d[i]=(a[i][n]-c)/a[i][i];
    }
    //******** RESULT DISPLAY *********//
    for(i=0;i<n;i++)
    cout<<d[i]<<endl;


    getch();
    return 0;
}