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?
# | User | Rating |
---|---|---|
1 | tourist | 3751 |
2 | Benq | 3727 |
3 | cnnfls_csy | 3691 |
4 | Radewoosh | 3651 |
5 | jiangly | 3632 |
6 | orzdevinwang | 3559 |
7 | -0.5 | 3545 |
8 | inaFSTream | 3478 |
9 | fantasy | 3468 |
10 | Rebelz | 3415 |
# | User | Contrib. |
---|---|---|
1 | adamant | 178 |
2 | awoo | 167 |
3 | BledDest | 165 |
4 | Um_nik | 164 |
5 | maroonrk | 163 |
6 | SecondThread | 160 |
7 | nor | 158 |
8 | -is-this-fft- | 154 |
9 | kostka | 146 |
10 | TheScrasse | 144 |
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?
Name |
---|
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
1/integer = inverse of integer quadratic generating function
x = max(array) $$$-$$$ min(array) = sqrt(sum)
Then x^2 = sqrt(sum)^2 = sum