Go: package main

import (
	"bufio"
	"fmt"
	"math"
	"os"
	"strconv"
)

var sc = bufio.NewScanner(os.Stdin)

func main() {
	sc.Split(bufio.ScanWords)
	for {
		data := nextInts(6)
		if data[0] == 0 || data[1] == 0 || data[2] == 0 || data[3] == 0 || data[4] == 0 || data[5] == 0 {
			break
		}
		fmt.Printf("%.3f\n", Round(GetX(data[0], data[1], data[2], data[3], data[4], data[5]), 3))
		fmt.Printf("%.3f\n", Round(GetY(data[0], data[1], data[2], data[3], data[4], data[5]), 3))
	}
}

func GetX(a, b, c, d, e, f float64) float64 {
	return ((c * e) - (b * f)) / ((a * e) - (b * d))
}

func GetY(a, b, c, d, e, f float64) float64 {
	return ((c * d) - (a * f)) / ((b * d) - (a * e))
}

func Round(f float64, places int) float64 {
	shift := math.Pow(10, float64(places))
	return math.Floor(f*shift+.5) / shift
}

func next() string {
	sc.Scan()
	return sc.Text()
}

func nextInt() float64 {
	a, _ := strconv.Atoi(next())
	return float64(a)
}

func nextInts(n int) []float64 {
	a := make([]float64, n)
	for i := 0; i < n; i++ {
		a[i] = nextInt()
	}
	return a
}

C++: #include<stdio.h>
#include<stdlib.h>
#include<iostream>
#include<string>
#include<vector>
#include<math.h>
#include<queue>
#include <algorithm>
#include<functional>
#include<cstdlib>
#include<cmath>


#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define CI cin >>
#define CO cout <<
#define E << endl;

using namespace std;

typedef pair<int, int> P;
typedef pair<long, long> LP;
typedef pair<int, P> PP;
typedef pair<long, LP> LPP;



int dy[] = { 0, 0, 1, -1, 0 };
int dx[] = { 1, -1, 0, 0, 0 };

int A = 0, B = 0, K = 0, T = 0, W = 0, N = 0, H = 0;
int n = 0;
double L = 0;
double S = 0;
double ar = 0, br = 0, cr = 0;
int answer = 0;

string C;
string sA, strB;
vector<vector<char>> map;
vector<double> num;
vector<string> str;

int sum = 0;

vector<int> value;
vector<int> weight;

int dp[110][10010];

int data_[210][2] = { -2 };

void input(void) {

	return;
}


int main(void) {

	int a = 0, b = 0, c = 0, d = 0, e = 0, f = 0;
	double x = 0;
	double y = 0;

	while (scanf("%d%d%d%d%d%d", &a, &b, &c, &d, &e, &f) != EOF) {
		y = (double)(c * d - a * f) / (double)(b * d - a * e);
		x = (double)(c - b * y) / (double)a;
		printf("%.3f %.3f\n", x, y);
	}



	return 0;
}

C++: #include<iostream>
#include<iomanip>
using namespace std;

int main(){
	double a,b,c,d,e,f,x,y;
	cout<<setprecision(3);
	cout<<fixed;
	while(cin>>a>>b>>c>>d>>e>>f){
		x=1.0/(a*e-b*d)*(e*c-b*f);
		y=1.0/(a*e-b*d)*(a*f-d*c);
		if(-0.0005<=x)x=0;
		if(-0.0005<=y)y=0;
		cout<<x<<" "<<y<<endl;
	}
	return 0;
}

C++: #include <iostream>
#include <iomanip>

using namespace std;

int main() {
	double a,b,c,d,e,f;
	double x,y;
	while(cin >> a >> b >> c >> d >> e >> f){
		x = (double)(c*e - b*f)/(a*e - b*d);
		y = (double)(c*d - a*f)/(b*d - a*e);
		cout << setprecision(3) << setiosflags(ios::fixed);
		cout << x+0.0000000001 << ' ' << y+0.0000001 << endl;
	}
	return 0;
}

C++: #include <iostream>
#include <iomanip>
using namespace std;
  
int main()
{
    double a, b, c, d, e, f;
  
    while (cin >> a >> b >> c >> d >> e >> f)
    {
        b = b * d / a;
        c = c * d / a;
        a = a * d / a;
  
        d = d - a;           // d = 0
        e = e - b;
        f = f - c;
      
        f = f * b / e;
        e = e * b / e;
  
  
        b = b - e;            // b = 0
        c = c - f;
  
        c = c / a;            // x = c
        a = a / a;
  
        f = f / e;            // y = f
        e = e / e;
  
        cout << fixed << setprecision(3) << c << " " << fixed << setprecision(3) << f << endl;
    }
  
    return 0;
}

C++: #include <iostream>
using namespace std;

int main(){
	float a[6];
	float x,y;
	while(true){
		cin >> a[0];
		cin >> a[1];
		cin >> a[2];
		cin >> a[3];
		cin >> a[4];
		cin >> a[5];
		if(cin.eof())
			break;
			
		x = (a[4]*a[2]-a[1]*a[5])/(a[0]*a[4]-a[1]*a[3]);
		y = (-a[3]*a[2]+a[0]*a[5])/(a[0]*a[4]-a[1]*a[3]);
		
		cout.precision(3);
		cout << x << " " << y << endl;
	}
	return 0;
}

C++: #include <iostream>
using namespace std;


int main()
{
	double x1, y1, a, x2, y2, b;
	for (int i = 0; i < 2; i++)
	{
		cin >> x1 >> y1 >> a >> x2 >> y2 >> b;


		double d1 = x2;
		double d2 = x1;
		double xx1 = d1 * x1;
		double xy1 = d1 * y1;
		double a1 = d1 * a;
		double xx2 = d2 * x2;
		double xy2 = d2 * y2;
		double b1 = d2 * b;
		double y = xy1 - xy2;
		double c = a1 - b1;
		y = c / y;


		d1 = y2;
		d2 = y1;
		xx1 = d1 * x1;
		xy1 = d1 * y1;
		a1 = d1 * a;
		xx2 = d2 * x2;
		xy2 = d2 * y2;
		b1 = d2 * b;
		double x = xx1 - xx2;
		c = a1 - b1;
		x = c / x;
		if (x == 0)
		{
			x = 0;
		}
		if (y == 0)
		{
			y = 0;
		}
		printf("%.3lf %.3lf\n", x, y);
	}
	return 0;
}

C++: solve :: [Double] -> String
solve [a,b,c,d,e,f] = (shows ((c*e-b*f)/(a*e-b*d)) " ") ++ (show $ (a*f-c*d)/(a*e-b*d))

main = getContents >>= mapM_ putStrLn . map solve . map (map read . words) . lines

C++: #include<iostream>
#include<stdio.h>

int main(){
	float a,b,c,d,e,f,x,y;
	while(scanf("%f",&a)){
	scanf("%f%f%f%f%f",&b,&c,&d,&e,&f);
	x=(c*e-b*f)/(a*e-b*d);
	y=(c*d-a*f)/(b*d-a*e);
	printf("%.3f %.3f",x,y);
	std::cout<<std::endl;
	}
	return 0;
	}

C++: #include <iostream>
using namespace std;

int main(){
  double a,b,c,d,e,f;
  while(cin>>a>>b>>c>>d>>e>>f){
    if(b*f-c*e!=0&&a*e-d*b!=0)printf("%.3f %.3f\n",(d*b-e*a)/(b*f-c*e),(a*f-d*c)/(a*e-d*b));
    if(b*f-c*e==0&&a*e-d*b==0)printf("0.000 0.000");
    if(b*f-c*e==0)printf("0.000 %.3f\n",(a*f-d*c)/(a*e-d*b));
    if(a*e-d*b==0)printf("%.3f 0.000\n",(d*b-e*a)/(b*f-c*e));
  }
  return 0;
}

C++: 
/* vo00_04.cpp */
#include <iostream>
#include <iomanip>
#include <cmath>
#include <cstdio>
using namespace std;

int is_double(double dl);
double m_round(double d);
int dmax(int d1, int d2) { return (d1 < d2) ? d2 : d1; }

int main()
{
	double x1, y1, a1;
	double x2, y2, a2;
	double x, y;
	bool f_x, f_y;

	while (true) {
		cin >> x1 >> y1 >> a1 >> x2 >> y2 >> a2;
		if (cin.eof()) break;
		


		f_x = false; f_y = false;

		int p = dmax(dmax(is_double(x1), is_double(x2)), dmax(is_double(y1), is_double(y2)));
		if (p) { p *= 10; x1 *= p; x2 *= p; y1 *= p; y2 *= p; }

		if (x1 && x2 && (y1 || y2)) {
			int temp = x1;
			x1 *= x2; y1 *= x2; a1 *= x2;
			x2 *= temp; y2 *= temp; a2 *= temp;

			double y3 = y2 - y1, a3 = a2 - a1;

			y = a3 / y3;
			f_y = true;
		}

		if (y1 && y2 && (x1 || x2)) {
			int temp = y1;
			x1 *= y2; y1 *= y2; a1 *= y2;
			x2 *= temp; y2 *= temp; a2 *= temp;

			double x3 = x2 - x1, a3 = a2 - a1;

			x = a3 / x3;

			f_x = true;
		}

		if (!f_x || !f_y) {
			// どちらかに0があれば
			if (!x1) { y = a1 / y1; f_y = true; }
			else if (!x2) { y = a2 / y2; f_y = true; }

			if (!y1) { x = a1 / x1; f_x = true; }
			else if (!y2) { x = a2 / x2; f_x = true; }

			if (f_x && !f_y) {

				if (!y1 && !y2) { y = 0; }

				else if (x1 && y1) { x1 *= x; a1 -= x1; y = a1 / y1; }
				else if (x2 && y2){ x2 *= x; a2 -= x2; y = a2 / y2; }

				f_y = true;
			}
			if (f_y && !f_x) {

				if (!x1 && !x2) { x = 0; }

				else if (y1 && x1) { y1 *= y; a1 -= y1; x = a1 / x1; }
				else if (y2 && x2) { y2 *= y; a2 -= y2; x = a2 / x2; }
				
				f_x = true;
			}
		}

		if (f_x && f_y) {
			x = m_round(x); y = m_round(y);
			printf("%.3lf %.3lf\n", x, y);
		}
	}

	return 0;
}

int is_double(double dl)
{
	dl = fabs(dl);
	int d = (int)dl;
	double temp = dl - (double)d;

	if (!temp) return 0;

	else {
		int i;
		for (i = 0; temp < 1; ++i) temp *= 10;

		return i;
	}
}

double m_round(double d)
{
	bool flag = false;
	if (d < 0) { flag = true; d = -d; }

	d *= 1000;
	d += 0.5;

	int t1 = (int)d;
	double t2 = d - (double)t1;
	d -= t2;

	d /= 1000;

	if (flag) { d = -d; }

	return d;
}