How did people solve this problem based on the fact that
max(a_1, a_2, ..., a_n) — min(a_1, a_2, ..., a_n) = x where a_1 + a_2 + ... + a_n = x^2
how is this correct?
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3857 |
| 2 | jiangly | 3810 |
| 3 | maroonrk | 3534 |
| 4 | tourist | 3528 |
| 5 | Kevin114514 | 3510 |
| 6 | turmax | 3411 |
| 7 | Um_nik | 3387 |
| 8 | Radewoosh | 3367 |
| 9 | heuristica | 3322 |
| 10 | strapple | 3317 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | maspy | 150 |
| 3 | Um_nik | 146 |
| 4 | Errichto | 139 |
| 5 | adamant | 136 |
| 6 | maroonrk | 134 |
| 7 | DNR | 133 |
| 7 | nik_exists | 133 |
| 9 | Dominater069 | 131 |
| 10 | AmShZ | 130 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Sep/04/2026 06:37:24 (g2).
Desktop version, switch to mobile version.
Supported by
It is not coreect for all {a_i}. The problem statement is to find such {a_i}
yes but what if a_1 = 1/a_2 that would make the relation inversely quadratic
How. a_i are positive integers. How a_1 = 1/a_2? Alse read the official solution
x = max(array) $$$-$$$ min(array) = sqrt(sum)
Then x^2 = sqrt(sum)^2 = sum