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 | jiangly | 4039 |
2 | tourist | 3841 |
3 | jqdai0815 | 3682 |
4 | ksun48 | 3590 |
5 | ecnerwala | 3542 |
6 | Benq | 3535 |
7 | orzdevinwang | 3526 |
8 | gamegame | 3477 |
9 | heuristica | 3357 |
10 | Radewoosh | 3355 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | -is-this-fft- | 165 |
3 | atcoder_official | 160 |
3 | Um_nik | 160 |
5 | djm03178 | 158 |
6 | Dominater069 | 156 |
7 | adamant | 153 |
8 | luogu_official | 151 |
8 | awoo | 151 |
10 | TheScrasse | 147 |
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