22598번 - Approximate Circle 스페셜 저지다국어

문제

Consider a set of $n$ points ($x_{1},ドル $y_{1}$), ..., ($x_{n},ドル$y_{n}$) on a Cartesian space. Your task is to write a program for regression to a circle $x^2 + y^2 + ax + by + c = 0$. In other words, your program should find a circle that minimizes the error. Here the error is measured by the sum over square distances between each point and the circle, which is given by:

$$\sum_{i=1}^{n}{(x_i^2 + y_i^2 + ax_i + by_i + c) ^2}$$

입력

The input begins with a line containing one integer $n$ (3 ≤ $n$ ≤ 40,000). Then $n$ lines follow. The $i$-th line contains two integers $x_{i}$ and $y_{i}$ (0 ≤ $x_{i},ドル $y_{i}$ ≤ 1,000), which denote the coordinates of the $i$-th point.

You can assume there are no cases in which all the points lie on a straight line.

출력

Print three integers $a,ドル $b$ and $c,ドル separated by space, to show the regressed function. The output values should be printed with three digits after the decimal point, and should not contain an error greater than 0.001.

제한

힌트