I'm getting tle with normal divisor algorithm. Is there some extra needed concept required for this problem..
# | User | Rating |
---|---|---|
1 | jiangly | 4039 |
2 | tourist | 3841 |
3 | jqdai0815 | 3682 |
4 | ksun48 | 3590 |
5 | ecnerwala | 3542 |
6 | Benq | 3535 |
7 | orzdevinwang | 3526 |
8 | gamegame | 3477 |
9 | heuristica | 3357 |
10 | Radewoosh | 3355 |
# | User | Contrib. |
---|---|---|
1 | cry | 168 |
2 | -is-this-fft- | 165 |
3 | atcoder_official | 160 |
3 | Um_nik | 160 |
5 | djm03178 | 158 |
6 | Dominater069 | 156 |
7 | adamant | 153 |
8 | luogu_official | 152 |
9 | awoo | 151 |
10 | TheScrasse | 147 |
I'm getting tle with normal divisor algorithm. Is there some extra needed concept required for this problem..
Name |
---|
You should fill a dp ( dp[i] = number of divisors of i) before getting tests.
Then use partial sum on dp and answer each query in O(1).
So similar to 546D - Солдат и игра с числами.
So use a fast input ouput like scanf printf.