Kiritow/OJ-Problems-Source
1
0
Fork 0
mirror of https://github.com/Kiritow/OJ-Problems-Source.git synced 2024-03-22 13:11:29 +08:00
Code Issues Projects Releases Wiki Activity

Create 1026.cpp

Browse Source
This commit is contained in:
Kirigaya Kazuto 2016-06-15 21:21:05 +08:00 committed by GitHub
parent 6125a14d65
commit a1ea0fd572
1 changed files with 32 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

32
QUSTOJ/1026.cpp Normal file
View File

@ -0,0 +1,32 @@
#include <iostream>
#include<cstdio>
#include<cmath>
using namespace std;
int n;
double A[110][110];
int main()
{
scanf("%d",&n);n++;
for(int i=1;i<n;i++)
for(int j=1;j<=n;j++)
scanf("%lf",&A[i][j]);
for(int i=1;i<n;i++)
{
int np=i;
for(int j=i+1;j<n;j++)if(abs(A[np][i])<abs(A[j][i]))np=j;
if(np!=i)swap(A[np],A[i]);
//print();
double GD=A[i][i];
for(int j=1;j<=n;j++)A[i][j]/=GD;
for(int j=1;j<n;j++)
if(j!=i){
GD=A[j][i];
for(int k=1;k<=n;k++)
A[j][k]-=GD*A[i][k];
}
}
for(int i=1;i<n-1;i++)
printf("%d ",(int)(round)(A[i][n]));
printf("%d\n",(int)(round)(A[n-1][n]));
return 0;
}