SWUST OJ#538 Gaussian elimination

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<map>
#define endl '\n'
#define N 200005
typedef long long ll;
using namespace std;
double a[1005][1005];
int main() {
	int n,m;cin>>n>>m;
	for(int i=1;i<=n;i++) {
		for(int j=1;j<=m;j++) {
			cin>>a[i][j];
		}
	}
	for(int k=1;k<=n;k++) {
		for(int i=1;i<=n;i++) {
			if(i==k) continue;
			double p=a[i][k]/a[k][k];
			for(int j=1;j<=m;j++) {
				a[i][j]-=p*a[k][j];
			}
		}
	}
	for(int i=1;i<n;i++) {
		printf("%.2lf ",a[i][m]/a[i][i]);
	}
	printf("%.2lf\n",a[n][m]/a[n][n]);
	return 0;
}