| SashaT9 Contest 1 |
|---|
| Finished |
You are given a $$$n \times n$$$ grid. You can perform the following operation:
Your task is to maximize the minimum value in the grid by performing the operations any number of times.
The first line contains a single integer $$$n$$$ ($$$1 \leq n \leq 1000$$$) — the size of the grid.
Each of the following $$$n$$$ lines contains $$$n$$$ integers $$$a_{i,j}$$$ ($$$1 \leq a_{i,j} \leq 10^9$$$) — the elements of the grid.
Output the maximum possible minimum value in the grid after the operations.
Your answer is considered correct if its absolute or relative error does not exceed $$$10^{-6}$$$.
Formally, let your answer be $$$a$$$, and the jury's answer be $$$b$$$. Your answer is accepted if and only if $$$\frac{|a-b|}{\max(1,|b|)}\le 10^{-6}$$$.
2 7 8 1 2
4.5000000
In the first example, we can obtain the answer in the following way:
Now, the minimal number in the grid is $$$4.5$$$.
| Name |
|---|


