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 | jiangly | 3976 |
2 | tourist | 3815 |
3 | jqdai0815 | 3682 |
4 | ksun48 | 3614 |
5 | orzdevinwang | 3526 |
6 | ecnerwala | 3514 |
7 | Benq | 3482 |
8 | hos.lyric | 3382 |
9 | gamegame | 3374 |
10 | heuristica | 3357 |
# | User | Contrib. |
---|---|---|
1 | cry | 169 |
2 | -is-this-fft- | 166 |
3 | Um_nik | 161 |
3 | atcoder_official | 161 |
5 | djm03178 | 157 |
6 | Dominater069 | 156 |
7 | adamant | 154 |
8 | luogu_official | 152 |
9 | awoo | 151 |
10 | TheScrasse | 147 |
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