i have tried all what i have to solve this problem, just need a hint or an algorithm to study and solve, not a code. please just a hint.
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | adamant | 157 |
6 | awoo | 157 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | djm03178 | 153 |
i have tried all what i have to solve this problem, just need a hint or an algorithm to study and solve, not a code. please just a hint.
Name |
---|
Don't look for a certain "algorithm" or anything to study. Very many problems can be solved by ad-hoc analysis and observations and little background knowledge. And this is also the best way to develop as a competitor.
In this particular case, you should look at the factorization of N and assure yourself that all its prime factors are present in the required quantity. The fact that smaller primes appear considerably more often than larger ones in that function might also be of help.
Like what? Please share your thoughts so far...