-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathGaussElimationMethod.cpp
More file actions
89 lines (76 loc) · 2.08 KB
/
GaussElimationMethod.cpp
File metadata and controls
89 lines (76 loc) · 2.08 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
#include <bits/stdc++.h>
using namespace std;
double arr[100][100];
void print(int n)
{
for(int i=0;i<n;i++)
{
for(int j=0;j<=n;j++)
cout<<arr[i][j]<<' ';
cout<<endl;
}
}
int main()
{
freopen("in.txt","r",stdin);
int n,i,j,k;
cin>>n;
for(i=0;i<n;i++)
{
for(j=0;j<=n;j++)
{
cin>>arr[i][j];
}
}
//print(n); cout<<endl;
/// use for Pivoting
for(i=0;i<n-1;i++)
{
double tmp=0; int best_row;
for(j=i;j<n;j++)
{
if(tmp<fabs(arr[j][i]))
{
tmp=fabs(arr[j][i]);
best_row=j;
}
}
if(best_row!=i)for(j=i;j<=n;j++)
{
swap(arr[i][j],arr[best_row][j]);
}
print(n); cout<<endl;
/// end Pivoting
if(fabs(arr[i][i])<.000001) return cout<<"no solution",0;
tmp=arr[i][i];
for(j=i;j<=n;j++)
{
arr[i][j]=arr[i][j]/tmp;
}
double tmp2;
for(j=i+1;j<n;j++)
{
tmp2=arr[j][i];
for(k=i;k<=n;k++)
{
tmp=arr[i][k]*tmp2;
arr[j][k]=arr[j][k]-tmp;
}
}
}
for(i=n-1;i>=0;i--)
{
double tmp=0;
for(j=i+1;j<n;j++)
{
tmp+=(arr[i][j]*arr[j][n]);
}
tmp=arr[i][n]-tmp;
arr[i][n]=tmp/arr[i][i];
}
for(i=0;i<n;i++)
{
cout<<'X'<<i<<'='<<arr[i][n]<<endl;
}
return 0;
}