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 | 3898 |
2 | tourist | 3840 |
3 | orzdevinwang | 3706 |
4 | ksun48 | 3691 |
5 | jqdai0815 | 3682 |
6 | ecnerwala | 3525 |
7 | gamegame | 3477 |
8 | Benq | 3468 |
9 | Ormlis | 3381 |
10 | maroonrk | 3379 |
# | User | Contrib. |
---|---|---|
1 | cry | 168 |
2 | -is-this-fft- | 165 |
3 | Dominater069 | 161 |
4 | Um_nik | 159 |
4 | atcoder_official | 159 |
6 | djm03178 | 157 |
7 | adamant | 153 |
8 | luogu_official | 150 |
9 | awoo | 149 |
10 | TheScrasse | 146 |
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