214A - System of Equations Of course, we can do this using brute-force method. Does a better way exists please share it. Thanks.
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
7 | cnnfls_csy | 3569 |
9 | ecnerwala | 3494 |
10 | Um_nik | 3396 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | Um_nik | 164 |
2 | maomao90 | 160 |
3 | -is-this-fft- | 159 |
4 | atcoder_official | 158 |
4 | cry | 158 |
4 | awoo | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 153 |
10 | maroonrk | 152 |
214A - System of Equations Of course, we can do this using brute-force method. Does a better way exists please share it. Thanks.
Название |
---|
$$$a + b ^ 2 = n$$$, so $$$a = n - b ^ 2$$$, so $$$a ^ 2 + b = (n - b ^ 2) ^ 2 + b = b ^ 4 - 2 * n * b ^ 2 + n ^ 2 + b = m$$$.
The last equation can be solved in $$$O(1)$$$. If you don't like math, don't open this link
you won't have much fun, if you try to solve that for $$$b$$$...
I'm sure every heathy person won't solve this problem using Ferrari's formula
Iterate over $$$a$$$ up to $$$\sqrt n$$$. For each $$$a$$$, compute $$$b$$$ from the first equation and check if the second equation holds. The complexity is $$$O(\sqrt n)$$$. If you want something better, have fun with ugly equations.