# | User | Rating |
---|---|---|
1 | tourist | 3985 |
2 | jiangly | 3885 |
3 | jqdai0815 | 3682 |
4 | Benq | 3580 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3506 |
7 | ecnerwala | 3505 |
8 | Radewoosh | 3457 |
9 | Kevin114514 | 3377 |
10 | gamegame | 3374 |
# | User | Contrib. |
---|---|---|
1 | cry | 170 |
2 | -is-this-fft- | 162 |
2 | Um_nik | 162 |
4 | atcoder_official | 160 |
5 | djm03178 | 157 |
5 | Dominater069 | 157 |
7 | adamant | 154 |
8 | luogu_official | 152 |
8 | awoo | 152 |
10 | TheScrasse | 147 |
Name |
---|
Cause when k == 1 it will run n time which is of order 1e9.... But log approach still gives WA on larger tescase as it might have precision errors..
could you give me an example for precision error, i mean int x = ln(n)/ln(k)
we dont have to precisely find out the value of exponent, we can just find the one that's closest, could you give me an example where this approach will fail.
i also did this approach, when n<k then there will be n operations, this also gave TLE
Can you check this out:
Comment-1203949
I tried the log approach, one with multiples of k^x and one with just k^x. (Where k^x will be the largest power of k <= n)