蓝桥杯算法提高VIP-解二元一次方程组（C++）直接法

#include <iostream>
#include<cstring>
#include<math.h>
#include<algorithm>
#include<stdio.h>
#include<set>
#include <iomanip>
#include<vector>
using namespace std;
int main() {
    long long a, b, c, d, e, f;
    cin >> a >> b >> c >> d >> e >> f;
    double x = (c * e - f * b) / (a * e - d * b);
    double y = (c * d - f * a) / (b * d - e * a);
    cout << x << " " << y << endl;
    return 0;
}