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 | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
4 | atcoder_official | 161 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 153 |
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
x = max(array) $$$-$$$ min(array) = sqrt(sum)
Then x^2 = sqrt(sum)^2 = sum