given an integer $$$n$$$, find the number of $$$(i,j,k)$$$ so that:
$$$1<i<j<k<=n$$$.
$$$i*j*k$$$ is a perfect square.
$$$3<n<=10^5$$$
given an integer $$$n$$$, find the number of $$$(i,j,k)$$$ so that:
$$$1<i<j<k<=n$$$.
$$$i*j*k$$$ is a perfect square.
$$$3<n<=10^5$$$
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3690 |
| 2 | jiangly | 3647 |
| 3 | Benq | 3581 |
| 4 | orzdevinwang | 3570 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | Radewoosh | 3509 |
| 8 | ecnerwala | 3486 |
| 9 | jqdai0815 | 3474 |
| 10 | gyh20 | 3447 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 164 |
| 3 | adamant | 163 |
| 4 | TheScrasse | 159 |
| 5 | nor | 157 |
| 6 | maroonrk | 155 |
| 7 | -is-this-fft- | 152 |
| 8 | Petr | 146 |
| 8 | orz | 146 |
| 10 | BledDest | 145 |
Im dumb so pls don't take this seriously though. I can now think of a O(N*sqrt(N)) solution, would it be exceeded time limit cause u did not mention the time.
the time limit 1.5s
well, 1e5*1e3=1e8 (could be less) might still get the job done.
what's your approach (help me pls)
It would probably be okay even with just 1 second TL, $$$n$$$ is only $$$10^5$$$, not even $$$2 \cdot 10^5$$$ or something.
can you give me the idea of your solution