高斯消去法

#include <stdio.h>
main()
{
    FILE *f;
    double a[15][15];
    double b[15],s;
    int i,j,k,n;
    f=fopen("Gauss.txt","r");
    fscanf(f,"%d",&n);
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=n;j++)
            fscanf(f,"%lf",&a[i][j]);
        fscanf(f,"%lf",&b[i]);
    }
    fclose(f);
    k=1;
    do{
    for(j=k+1;j<=n;j++)
        a[k][j]=a[k][j]/a[k][k];           //把a[k][k]消为1
    b[k]=b[k]/a[k][k];
    for(i=k+1;i<=n;i++)
    {
        for(j=k+1;j<=n;j++)
            a[i][j]=a[i][j]-a[i][k]*a[k][j];     //消元过程
        b[i]=b[i]-a[i][k]*b[k];
    }
    if(k==n-1)
        break;
    k++;
    }while(1);
       b[n]=b[n]/a[n][n];
    for(i=n-1;i>=1;i--)
    {
        s=0;
        for(j=i+1;j<=n;j++)
            s=s+a[i][j]*b[j];      //回代过程  求一个累加
        b[i]=b[i]-s;
    }
    for(i=1;i<=n;i++)
        printf("b[%2d]=%lf\n",i,b[i]);
}

Guass.txt
10
4 2 -3 -1 2 1 0 0 0 0 5
8 6 -5 -3 6 5 0 1 0 0 12
4 2 -2 -1 3 2 -1 0 3 1 3
0 -2 1 5 -1 3 -1 1 9 4 2
-4 2 6 -1 6 7 -3 3 2 3 3
8 6 -8 5 7 17 2 6 -3 5 46
0 2 -1 3 -4 2 5 3 0 1 13
16 10 -11 -9 17 34 2 -1 2 2 38
4 6 2 -7 13 9 2 0 12 4 19
0 0 -1 8 -3 -24 -8 6 3 -1 -21