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$$$
# | User | Rating |
---|---|---|
1 | tourist | 3845 |
2 | jiangly | 3707 |
3 | Benq | 3630 |
4 | orzdevinwang | 3573 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | jqdai0815 | 3532 |
8 | ecnerwala | 3501 |
9 | gyh20 | 3447 |
10 | Rebelz | 3409 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 171 |
2 | adamant | 163 |
3 | awoo | 161 |
4 | nor | 152 |
5 | maroonrk | 151 |
5 | -is-this-fft- | 151 |
7 | TheScrasse | 148 |
8 | atcoder_official | 146 |
9 | Petr | 145 |
10 | pajenegod | 144 |
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$$$
Name |
---|
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