Аудит информационной безопасности. Прикладная статистика. Учебное пособие

count_num_lines(); printf("\nNumber of points: N=%d", N); do{ printf("\nInput power of approximation polinom K<N: "); scanf("%d", &K); }while(K>=N); allocmatrix(); rewind(InFile); //read data from file readmatrix(); //check if there are 0 on main diagonal and exchange rows in that case diagonal(); fclose(InFile); //printmatrix(); //process rows for(k=0; k<K+1; k++){ for(i=k+1; i<K+1; i++){ if(sums[k][k]==0){ printf("\nSolution is not exist.\n"); return; } float M = sums[i][k] / sums[k][k]; for(j=k; j<K+1; j++){ sums[i][j] -= M * sums[k][j]; } b[i] -= M*b[k]; } } //printmatrix(); for(i=(K+1)-1; i>=0; i--){ float s = 0; for(j = i; j<K+1; j++){ s = s + sums[i][j]*a[j]; } a[i] = (b[i] - s) / sums[i][i]; } printresult(); freematrix(); }