#include <stdio.h>
#include <math.h>
int main() {
int N;
int i, j, k;
double A[10][11], X[10];
double temp;
printf("방정식의 수 : ");
scanf("%d", &N);
for (i=0; i<N; i++) {
printf("\n방정식 %d 의 계수\n", i+1);
for (j=0; j<N+1; j++) {
printf("\tA%d%d = ", i+1, j+1);
scanf("%lf", &temp);
A[i][j] = temp;
}
}
printf("\n\n방정식 :\n");
for (i=0; i<N; i++) {
printf("\t");
for (j=0; j<N+1; j++) {
if (j == N)
printf("%.3lf", A[i][j], j+1);
else if (j == N-1)
printf("%.3lf * X%d = ", A[i][j], j+1);
else
printf("%.3lf * X%d + ", A[i][j], j+1);
}
printf("\n");
}
printf("\n\n");
for (k=0; k<N-1; k++) {
for (i=k+1; i<N; i++) {
for (j=k+1; j<N+1; j++) {
A[i][j] = A[i][j] - (A[k][j] / A[k][k]) * A[i][k];
}
}
}
X[N-1] = A[N-1][N] / A[N-1][N-1];
for (i=N-2; i>=0; i--) {
temp = 0;
for (j = i+1; j < N; j++) {
temp = temp + A[i][j] * X[j];
}
X[i] = (A[i][N] - temp) / A[i][i];
}
for (i=0; i<N; i++)
printf("X%d = %.5lf\n", i+1, X[i]);
return (0);
}
|
|
|
